./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b38de45df8f558469e0ee724acb9ff4d380fa7bca593c33e5a93134ad362699b --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:14:35,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:14:35,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:14:35,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:14:35,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:14:35,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:14:35,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:14:35,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:14:35,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:14:35,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:14:35,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:14:35,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:14:35,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:14:35,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:14:35,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:14:35,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:14:35,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:14:35,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:14:35,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:14:35,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:14:35,908 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:14:35,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:14:35,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:14:35,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:14:35,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:14:35,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:14:35,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:14:35,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:14:35,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:14:35,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:14:35,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:14:35,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:14:35,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:14:35,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:14:35,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:14:35,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:14:35,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:14:35,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:14:35,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:14:35,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:14:35,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:14:35,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:14:35,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:14:35,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:14:35,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:14:35,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:14:35,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:14:35,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:14:35,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:14:35,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:14:35,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:14:35,965 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:14:35,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:14:35,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:14:35,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:14:35,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:14:35,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:14:35,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:14:35,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:14:35,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:14:35,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:14:35,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:14:35,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:14:35,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:14:35,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:14:35,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:14:35,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:14:35,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:14:35,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:14:35,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:14:35,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:14:35,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:14:35,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:14:35,971 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:14:35,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:14:35,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:14:35,972 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 -> b38de45df8f558469e0ee724acb9ff4d380fa7bca593c33e5a93134ad362699b [2022-07-13 21:14:36,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:14:36,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:14:36,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:14:36,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:14:36,275 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:14:36,276 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.08.cil-1.c [2022-07-13 21:14:36,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba72cb87/9dcc5dc1d3854402bb4229491fc6ad5b/FLAGf271c9023 [2022-07-13 21:14:36,809 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:14:36,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2022-07-13 21:14:36,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba72cb87/9dcc5dc1d3854402bb4229491fc6ad5b/FLAGf271c9023 [2022-07-13 21:14:37,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba72cb87/9dcc5dc1d3854402bb4229491fc6ad5b [2022-07-13 21:14:37,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:14:37,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:14:37,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:14:37,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:14:37,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:14:37,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0d1218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37, skipping insertion in model container [2022-07-13 21:14:37,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:14:37,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:14:37,377 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.08.cil-1.c[914,927] [2022-07-13 21:14:37,456 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.08.cil-1.c[7125,7138] [2022-07-13 21:14:37,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:14:37,582 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:14:37,593 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.08.cil-1.c[914,927] [2022-07-13 21:14:37,615 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.08.cil-1.c[7125,7138] [2022-07-13 21:14:37,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:14:37,665 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:14:37,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37 WrapperNode [2022-07-13 21:14:37,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:14:37,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:14:37,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:14:37,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:14:37,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,738 INFO L137 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 809 [2022-07-13 21:14:37,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:14:37,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:14:37,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:14:37,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:14:37,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:14:37,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:14:37,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:14:37,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:14:37,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (1/1) ... [2022-07-13 21:14:37,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:14:37,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:14:37,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 21:14:37,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 21:14:37,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:14:37,876 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 21:14:37,876 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 21:14:37,876 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-13 21:14:37,876 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-13 21:14:37,876 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-13 21:14:37,876 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-13 21:14:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-13 21:14:37,877 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-13 21:14:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-13 21:14:37,877 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-13 21:14:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-13 21:14:37,877 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-13 21:14:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-13 21:14:37,878 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-13 21:14:37,878 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-13 21:14:37,878 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-13 21:14:37,878 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-13 21:14:37,878 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-13 21:14:37,878 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-13 21:14:37,878 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-13 21:14:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-13 21:14:37,879 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-13 21:14:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:14:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-13 21:14:37,879 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-13 21:14:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-13 21:14:37,880 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-13 21:14:37,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:14:37,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:14:37,880 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-13 21:14:37,880 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-13 21:14:37,999 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:14:38,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:14:38,736 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:14:38,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:14:38,753 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-07-13 21:14:38,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:38 BoogieIcfgContainer [2022-07-13 21:14:38,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:14:38,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:14:38,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:14:38,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:14:38,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:14:37" (1/3) ... [2022-07-13 21:14:38,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4832c8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:14:38, skipping insertion in model container [2022-07-13 21:14:38,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:14:37" (2/3) ... [2022-07-13 21:14:38,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4832c8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:14:38, skipping insertion in model container [2022-07-13 21:14:38,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:38" (3/3) ... [2022-07-13 21:14:38,764 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2022-07-13 21:14:38,777 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:14:38,777 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:14:38,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:14:38,852 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7406b394, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ef259e9 [2022-07-13 21:14:38,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-13 21:14:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 330 states have (on average 1.621212121212121) internal successors, (535), 337 states have internal predecessors, (535), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-13 21:14:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:38,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:38,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:38,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1531446909, now seen corresponding path program 1 times [2022-07-13 21:14:38,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:38,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781879149] [2022-07-13 21:14:38,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:39,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781879149] [2022-07-13 21:14:39,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781879149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:39,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:39,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:14:39,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984633616] [2022-07-13 21:14:39,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:39,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:14:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:39,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:14:39,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:14:39,197 INFO L87 Difference]: Start difference. First operand has 384 states, 330 states have (on average 1.621212121212121) internal successors, (535), 337 states have internal predecessors, (535), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) 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) [2022-07-13 21:14:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:40,322 INFO L93 Difference]: Finished difference Result 880 states and 1386 transitions. [2022-07-13 21:14:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:14:40,325 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 [2022-07-13 21:14:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:40,338 INFO L225 Difference]: With dead ends: 880 [2022-07-13 21:14:40,338 INFO L226 Difference]: Without dead ends: 510 [2022-07-13 21:14:40,343 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:14:40,346 INFO L413 NwaCegarLoop]: 593 mSDtfsCounter, 691 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:40,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1966 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 21:14:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-07-13 21:14:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 470. [2022-07-13 21:14:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-07-13 21:14:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 696 transitions. [2022-07-13 21:14:40,441 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 696 transitions. Word has length 59 [2022-07-13 21:14:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:40,442 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 696 transitions. [2022-07-13 21:14:40,442 INFO L496 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) [2022-07-13 21:14:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 696 transitions. [2022-07-13 21:14:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:40,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:40,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:40,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:14:40,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:40,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 396825793, now seen corresponding path program 1 times [2022-07-13 21:14:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:40,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018979293] [2022-07-13 21:14:40,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:40,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:40,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:40,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:40,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:40,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:40,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:40,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:40,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018979293] [2022-07-13 21:14:40,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018979293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:40,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:40,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:14:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133246771] [2022-07-13 21:14:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:40,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:14:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:14:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:14:40,612 INFO L87 Difference]: Start difference. First operand 470 states and 696 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:41,674 INFO L93 Difference]: Finished difference Result 819 states and 1175 transitions. [2022-07-13 21:14:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:14:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-07-13 21:14:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:41,680 INFO L225 Difference]: With dead ends: 819 [2022-07-13 21:14:41,680 INFO L226 Difference]: Without dead ends: 641 [2022-07-13 21:14:41,681 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:14:41,683 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 1098 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:41,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 2152 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 21:14:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-13 21:14:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 566. [2022-07-13 21:14:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 474 states have (on average 1.481012658227848) internal successors, (702), 483 states have internal predecessors, (702), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-07-13 21:14:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 830 transitions. [2022-07-13 21:14:41,722 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 830 transitions. Word has length 59 [2022-07-13 21:14:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:41,722 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 830 transitions. [2022-07-13 21:14:41,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 830 transitions. [2022-07-13 21:14:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:41,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:41,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:41,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:14:41,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1290312131, now seen corresponding path program 1 times [2022-07-13 21:14:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:41,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668921688] [2022-07-13 21:14:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:41,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:41,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:41,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:41,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:41,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668921688] [2022-07-13 21:14:41,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668921688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:41,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:41,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:14:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204720298] [2022-07-13 21:14:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:41,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:14:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:14:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:14:41,886 INFO L87 Difference]: Start difference. First operand 566 states and 830 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:14:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:42,875 INFO L93 Difference]: Finished difference Result 868 states and 1245 transitions. [2022-07-13 21:14:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:14:42,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-07-13 21:14:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:42,882 INFO L225 Difference]: With dead ends: 868 [2022-07-13 21:14:42,882 INFO L226 Difference]: Without dead ends: 600 [2022-07-13 21:14:42,887 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:14:42,890 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 490 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:42,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 2447 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 21:14:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-07-13 21:14:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 571. [2022-07-13 21:14:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 478 states have (on average 1.4728033472803348) internal successors, (704), 487 states have internal predecessors, (704), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-07-13 21:14:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 833 transitions. [2022-07-13 21:14:42,934 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 833 transitions. Word has length 59 [2022-07-13 21:14:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:42,934 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 833 transitions. [2022-07-13 21:14:42,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:14:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 833 transitions. [2022-07-13 21:14:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:42,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:42,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:42,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:14:42,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:42,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1565071745, now seen corresponding path program 1 times [2022-07-13 21:14:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:42,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156668995] [2022-07-13 21:14:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:42,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:43,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:43,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156668995] [2022-07-13 21:14:43,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156668995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:43,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:43,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:14:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627235872] [2022-07-13 21:14:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:43,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:14:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:14:43,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:14:43,073 INFO L87 Difference]: Start difference. First operand 571 states and 833 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 21:14:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:44,975 INFO L93 Difference]: Finished difference Result 2239 states and 3111 transitions. [2022-07-13 21:14:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 21:14:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-07-13 21:14:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:44,986 INFO L225 Difference]: With dead ends: 2239 [2022-07-13 21:14:44,986 INFO L226 Difference]: Without dead ends: 1966 [2022-07-13 21:14:44,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 21:14:44,997 INFO L413 NwaCegarLoop]: 779 mSDtfsCounter, 2158 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:44,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2425 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 21:14:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2022-07-13 21:14:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1708. [2022-07-13 21:14:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1375 states have (on average 1.3665454545454545) internal successors, (1879), 1404 states have internal predecessors, (1879), 176 states have call successors, (176), 130 states have call predecessors, (176), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-07-13 21:14:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2311 transitions. [2022-07-13 21:14:45,110 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2311 transitions. Word has length 59 [2022-07-13 21:14:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:45,111 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 2311 transitions. [2022-07-13 21:14:45,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 21:14:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2311 transitions. [2022-07-13 21:14:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:45,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:45,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:45,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:14:45,115 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 593397058, now seen corresponding path program 1 times [2022-07-13 21:14:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:45,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840521166] [2022-07-13 21:14:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:45,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:45,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:45,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:45,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840521166] [2022-07-13 21:14:45,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840521166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:45,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:45,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:14:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207840475] [2022-07-13 21:14:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:45,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:14:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:45,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:14:45,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:14:45,254 INFO L87 Difference]: Start difference. First operand 1708 states and 2311 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:14:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:46,209 INFO L93 Difference]: Finished difference Result 3307 states and 4430 transitions. [2022-07-13 21:14:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:14:46,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-07-13 21:14:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:46,217 INFO L225 Difference]: With dead ends: 3307 [2022-07-13 21:14:46,218 INFO L226 Difference]: Without dead ends: 1897 [2022-07-13 21:14:46,222 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:14:46,223 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 488 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:46,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 2445 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:14:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-07-13 21:14:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1753. [2022-07-13 21:14:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1411 states have (on average 1.3508150248051027) internal successors, (1906), 1440 states have internal predecessors, (1906), 176 states have call successors, (176), 130 states have call predecessors, (176), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-07-13 21:14:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2350 transitions. [2022-07-13 21:14:46,314 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2350 transitions. Word has length 59 [2022-07-13 21:14:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:46,315 INFO L495 AbstractCegarLoop]: Abstraction has 1753 states and 2350 transitions. [2022-07-13 21:14:46,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:14:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2350 transitions. [2022-07-13 21:14:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:46,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:46,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:46,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:14:46,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1212041276, now seen corresponding path program 1 times [2022-07-13 21:14:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:46,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084708763] [2022-07-13 21:14:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:46,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:14:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:46,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:14:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:14:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:46,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:14:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:14:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:46,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:14:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:14:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:14:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:14:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:14:46,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084708763] [2022-07-13 21:14:46,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084708763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:14:46,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:14:46,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:14:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92578409] [2022-07-13 21:14:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:14:46,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:14:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:14:46,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:14:46,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:14:46,454 INFO L87 Difference]: Start difference. First operand 1753 states and 2350 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:14:47,404 INFO L93 Difference]: Finished difference Result 3188 states and 4187 transitions. [2022-07-13 21:14:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:14:47,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-07-13 21:14:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:14:47,415 INFO L225 Difference]: With dead ends: 3188 [2022-07-13 21:14:47,415 INFO L226 Difference]: Without dead ends: 1952 [2022-07-13 21:14:47,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:14:47,420 INFO L413 NwaCegarLoop]: 560 mSDtfsCounter, 1121 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:14:47,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1878 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:14:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-07-13 21:14:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1731. [2022-07-13 21:14:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1397 states have (on average 1.3471725125268432) internal successors, (1882), 1420 states have internal predecessors, (1882), 176 states have call successors, (176), 130 states have call predecessors, (176), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-07-13 21:14:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2310 transitions. [2022-07-13 21:14:47,525 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2310 transitions. Word has length 59 [2022-07-13 21:14:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:14:47,526 INFO L495 AbstractCegarLoop]: Abstraction has 1731 states and 2310 transitions. [2022-07-13 21:14:47,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:14:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2310 transitions. [2022-07-13 21:14:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 21:14:47,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:14:47,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:47,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:14:47,528 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:14:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:14:47,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1088781314, now seen corresponding path program 1 times [2022-07-13 21:14:47,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:14:47,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972292593] [2022-07-13 21:14:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:14:47,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:14:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:14:47,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:14:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:14:47,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:14:47,611 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:14:47,612 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-13 21:14:47,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-13 21:14:47,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:14:47,618 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:14:47,621 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:14:47,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:14:47 BoogieIcfgContainer [2022-07-13 21:14:47,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:14:47,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:14:47,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:14:47,740 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:14:47,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:14:38" (3/4) ... [2022-07-13 21:14:47,742 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:14:47,837 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:14:47,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:14:47,838 INFO L158 Benchmark]: Toolchain (without parser) took 10695.14ms. Allocated memory was 83.9MB in the beginning and 197.1MB in the end (delta: 113.2MB). Free memory was 49.7MB in the beginning and 113.6MB in the end (delta: -63.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-07-13 21:14:47,838 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:14:47,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.26ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 49.5MB in the beginning and 73.4MB in the end (delta: -23.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-07-13 21:14:47,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.84ms. Allocated memory is still 107.0MB. Free memory was 73.4MB in the beginning and 69.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:14:47,839 INFO L158 Benchmark]: Boogie Preprocessor took 63.34ms. Allocated memory is still 107.0MB. Free memory was 69.3MB in the beginning and 66.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:14:47,839 INFO L158 Benchmark]: RCFGBuilder took 953.72ms. Allocated memory is still 107.0MB. Free memory was 65.6MB in the beginning and 71.0MB in the end (delta: -5.3MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-07-13 21:14:47,840 INFO L158 Benchmark]: TraceAbstraction took 8980.68ms. Allocated memory was 107.0MB in the beginning and 197.1MB in the end (delta: 90.2MB). Free memory was 70.5MB in the beginning and 126.1MB in the end (delta: -55.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2022-07-13 21:14:47,840 INFO L158 Benchmark]: Witness Printer took 97.75ms. Allocated memory is still 197.1MB. Free memory was 126.1MB in the beginning and 113.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 21:14:47,843 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.26ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 49.5MB in the beginning and 73.4MB in the end (delta: -23.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.84ms. Allocated memory is still 107.0MB. Free memory was 73.4MB in the beginning and 69.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.34ms. Allocated memory is still 107.0MB. Free memory was 69.3MB in the beginning and 66.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 953.72ms. Allocated memory is still 107.0MB. Free memory was 65.6MB in the beginning and 71.0MB in the end (delta: -5.3MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8980.68ms. Allocated memory was 107.0MB in the beginning and 197.1MB in the end (delta: 90.2MB). Free memory was 70.5MB in the beginning and 126.1MB in the end (delta: -55.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 97.75ms. Allocated memory is still 197.1MB. Free memory was 126.1MB in the beginning and 113.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int t7_pc = 0; [L508] int t8_pc = 0; [L509] int m_st ; [L510] int t1_st ; [L511] int t2_st ; [L512] int t3_st ; [L513] int t4_st ; [L514] int t5_st ; [L515] int t6_st ; [L516] int t7_st ; [L517] int t8_st ; [L518] int m_i ; [L519] int t1_i ; [L520] int t2_i ; [L521] int t3_i ; [L522] int t4_i ; [L523] int t5_i ; [L524] int t6_i ; [L525] int t7_i ; [L526] int t8_i ; [L527] int M_E = 2; [L528] int T1_E = 2; [L529] int T2_E = 2; [L530] int T3_E = 2; [L531] int T4_E = 2; [L532] int T5_E = 2; [L533] int T6_E = 2; [L534] int T7_E = 2; [L535] int T8_E = 2; [L536] int E_M = 2; [L537] int E_1 = 2; [L538] int E_2 = 2; [L539] int E_3 = 2; [L540] int E_4 = 2; [L541] int E_5 = 2; [L542] int E_6 = 2; [L543] int E_7 = 2; [L544] int E_8 = 2; [L555] int token ; [L557] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L1837] COND TRUE __VERIFIER_nondet_int() [L1838] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_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, 384 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6123 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6046 mSDsluCounter, 13313 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9660 mSDsCounter, 1090 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7481 IncrementalHoareTripleChecker+Invalid, 8571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1090 mSolverCounterUnsat, 3653 mSDtfsCounter, 7481 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1753occurred in iteration=5, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 767 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 21:14:47,896 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