./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.09.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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.09.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 b624ae719a4082a36ede7e321957dcadc62ef7cb91507fddf336d6b301c1668d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:10,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:10,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:10,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:10,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:10,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:10,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:10,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:10,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:10,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:10,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:10,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:11,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:11,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:11,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:11,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:11,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:11,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:11,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:11,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:11,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:11,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:11,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:11,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:11,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:11,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:11,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:11,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:11,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:11,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:11,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:11,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:11,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:11,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:11,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:11,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:11,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:11,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:11,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:11,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:11,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:11,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:59:11,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:11,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:11,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:11,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:11,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:11,058 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:11,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:11,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:11,059 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:11,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:11,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:11,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:11,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:11,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:11,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:11,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:11,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:11,061 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:11,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:11,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:11,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:11,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:11,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:11,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:11,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:11,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:11,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:11,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:11,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:11,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:11,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:11,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:11,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:11,063 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 -> b624ae719a4082a36ede7e321957dcadc62ef7cb91507fddf336d6b301c1668d [2022-02-20 19:59:11,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:11,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:11,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:11,311 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:11,311 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:11,312 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.09.cil-1.c [2022-02-20 19:59:11,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7963a04ff/3e4544f98e26444e9785a86097f9a4ca/FLAG11c811e18 [2022-02-20 19:59:11,726 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:11,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.09.cil-1.c [2022-02-20 19:59:11,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7963a04ff/3e4544f98e26444e9785a86097f9a4ca/FLAG11c811e18 [2022-02-20 19:59:12,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7963a04ff/3e4544f98e26444e9785a86097f9a4ca [2022-02-20 19:59:12,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:12,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:12,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:12,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:12,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:12,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e321bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12, skipping insertion in model container [2022-02-20 19:59:12,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:12,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:12,325 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.09.cil-1.c[914,927] [2022-02-20 19:59:12,379 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.09.cil-1.c[7125,7138] [2022-02-20 19:59:12,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:12,504 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:12,521 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.09.cil-1.c[914,927] [2022-02-20 19:59:12,537 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.09.cil-1.c[7125,7138] [2022-02-20 19:59:12,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:12,617 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:12,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12 WrapperNode [2022-02-20 19:59:12,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:12,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:12,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:12,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:12,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,694 INFO L137 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 867 [2022-02-20 19:59:12,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:12,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:12,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:12,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:12,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:12,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:12,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:12,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:12,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:12,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:12,818 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-02-20 19:59:12,881 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-02-20 19:59:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:12,906 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:12,906 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:12,906 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:12,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:12,906 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:12,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:12,906 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:12,906 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:12,907 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:12,907 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:12,907 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:12,907 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:12,907 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:12,907 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:12,907 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:12,909 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:13,088 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:13,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:13,780 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:13,789 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:13,789 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 19:59:13,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:13 BoogieIcfgContainer [2022-02-20 19:59:13,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:13,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:13,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:13,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:13,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:12" (1/3) ... [2022-02-20 19:59:13,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a427637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:13, skipping insertion in model container [2022-02-20 19:59:13,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12" (2/3) ... [2022-02-20 19:59:13,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a427637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:13, skipping insertion in model container [2022-02-20 19:59:13,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:13" (3/3) ... [2022-02-20 19:59:13,797 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.09.cil-1.c [2022-02-20 19:59:13,800 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:13,801 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:13,848 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:13,852 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:13,852 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 409 states, 354 states have (on average 1.6271186440677967) internal successors, (576), 361 states have internal predecessors, (576), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-02-20 19:59:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:13,879 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:13,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:13,880 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:13,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1585753871, now seen corresponding path program 1 times [2022-02-20 19:59:13,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:13,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768459325] [2022-02-20 19:59:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {453#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:14,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {453#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:14,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {414#(= ~q_read_ev~0 2)} #1549#return; {414#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {454#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {455#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {455#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#(= |old(~q_read_ev~0)| 0)} assume true; {455#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {455#(= |old(~q_read_ev~0)| 0)} {414#(= ~q_read_ev~0 2)} #1551#return; {413#false} is VALID [2022-02-20 19:59:14,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {412#true} havoc ~__retres1~0; {412#true} is VALID [2022-02-20 19:59:14,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#true} assume !(1 == ~p_dw_pc~0); {412#true} is VALID [2022-02-20 19:59:14,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} ~__retres1~0 := 0; {412#true} is VALID [2022-02-20 19:59:14,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {412#true} #res := ~__retres1~0; {412#true} is VALID [2022-02-20 19:59:14,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,144 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {412#true} {412#true} #1545#return; {412#true} is VALID [2022-02-20 19:59:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {412#true} havoc ~__retres1~1; {412#true} is VALID [2022-02-20 19:59:14,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#true} assume !(1 == ~c_dr_pc~0); {412#true} is VALID [2022-02-20 19:59:14,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} ~__retres1~1 := 0; {412#true} is VALID [2022-02-20 19:59:14,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {412#true} #res := ~__retres1~1; {412#true} is VALID [2022-02-20 19:59:14,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,149 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {412#true} {412#true} #1547#return; {412#true} is VALID [2022-02-20 19:59:14,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {412#true} is VALID [2022-02-20 19:59:14,150 INFO L272 TraceCheckUtils]: 1: Hoare triple {412#true} call #t~ret8 := is_do_write_p_triggered(); {412#true} is VALID [2022-02-20 19:59:14,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} havoc ~__retres1~0; {412#true} is VALID [2022-02-20 19:59:14,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {412#true} assume !(1 == ~p_dw_pc~0); {412#true} is VALID [2022-02-20 19:59:14,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {412#true} ~__retres1~0 := 0; {412#true} is VALID [2022-02-20 19:59:14,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {412#true} #res := ~__retres1~0; {412#true} is VALID [2022-02-20 19:59:14,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,151 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {412#true} {412#true} #1545#return; {412#true} is VALID [2022-02-20 19:59:14,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {412#true} is VALID [2022-02-20 19:59:14,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {412#true} is VALID [2022-02-20 19:59:14,151 INFO L272 TraceCheckUtils]: 10: Hoare triple {412#true} call #t~ret9 := is_do_read_c_triggered(); {412#true} is VALID [2022-02-20 19:59:14,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {412#true} havoc ~__retres1~1; {412#true} is VALID [2022-02-20 19:59:14,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {412#true} assume !(1 == ~c_dr_pc~0); {412#true} is VALID [2022-02-20 19:59:14,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {412#true} ~__retres1~1 := 0; {412#true} is VALID [2022-02-20 19:59:14,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {412#true} #res := ~__retres1~1; {412#true} is VALID [2022-02-20 19:59:14,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,153 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {412#true} {412#true} #1547#return; {412#true} is VALID [2022-02-20 19:59:14,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {412#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {412#true} is VALID [2022-02-20 19:59:14,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {412#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {412#true} is VALID [2022-02-20 19:59:14,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,153 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {412#true} {413#false} #1553#return; {413#false} is VALID [2022-02-20 19:59:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {454#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {412#true} is VALID [2022-02-20 19:59:14,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {412#true} is VALID [2022-02-20 19:59:14,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {412#true} {413#false} #1555#return; {413#false} is VALID [2022-02-20 19:59:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {412#true} havoc ~__retres1~2; {412#true} is VALID [2022-02-20 19:59:14,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {412#true} is VALID [2022-02-20 19:59:14,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} #res := ~__retres1~2; {412#true} is VALID [2022-02-20 19:59:14,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,166 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {412#true} {413#false} #1557#return; {413#false} is VALID [2022-02-20 19:59:14,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {412#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {412#true} is VALID [2022-02-20 19:59:14,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {412#true} is VALID [2022-02-20 19:59:14,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {414#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {414#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {414#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#(= ~q_read_ev~0 2)} call update_channels1(); {452#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:14,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {453#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:14,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {453#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {453#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:14,170 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {453#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {414#(= ~q_read_ev~0 2)} #1549#return; {414#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {414#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {414#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {414#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {414#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {414#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {414#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {414#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,180 INFO L272 TraceCheckUtils]: 12: Hoare triple {414#(= ~q_read_ev~0 2)} call fire_delta_events1(); {454#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:14,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {455#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {455#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {455#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {455#(= |old(~q_read_ev~0)| 0)} assume true; {455#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,182 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {455#(= |old(~q_read_ev~0)| 0)} {414#(= ~q_read_ev~0 2)} #1551#return; {413#false} is VALID [2022-02-20 19:59:14,182 INFO L272 TraceCheckUtils]: 17: Hoare triple {413#false} call activate_threads1(); {456#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:14,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {456#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {412#true} is VALID [2022-02-20 19:59:14,183 INFO L272 TraceCheckUtils]: 19: Hoare triple {412#true} call #t~ret8 := is_do_write_p_triggered(); {412#true} is VALID [2022-02-20 19:59:14,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {412#true} havoc ~__retres1~0; {412#true} is VALID [2022-02-20 19:59:14,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {412#true} assume !(1 == ~p_dw_pc~0); {412#true} is VALID [2022-02-20 19:59:14,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {412#true} ~__retres1~0 := 0; {412#true} is VALID [2022-02-20 19:59:14,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {412#true} #res := ~__retres1~0; {412#true} is VALID [2022-02-20 19:59:14,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,184 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {412#true} {412#true} #1545#return; {412#true} is VALID [2022-02-20 19:59:14,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {412#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {412#true} is VALID [2022-02-20 19:59:14,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {412#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {412#true} is VALID [2022-02-20 19:59:14,184 INFO L272 TraceCheckUtils]: 28: Hoare triple {412#true} call #t~ret9 := is_do_read_c_triggered(); {412#true} is VALID [2022-02-20 19:59:14,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {412#true} havoc ~__retres1~1; {412#true} is VALID [2022-02-20 19:59:14,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {412#true} assume !(1 == ~c_dr_pc~0); {412#true} is VALID [2022-02-20 19:59:14,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {412#true} ~__retres1~1 := 0; {412#true} is VALID [2022-02-20 19:59:14,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {412#true} #res := ~__retres1~1; {412#true} is VALID [2022-02-20 19:59:14,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,186 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {412#true} {412#true} #1547#return; {412#true} is VALID [2022-02-20 19:59:14,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {412#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {412#true} is VALID [2022-02-20 19:59:14,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {412#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {412#true} is VALID [2022-02-20 19:59:14,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,186 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {412#true} {413#false} #1553#return; {413#false} is VALID [2022-02-20 19:59:14,186 INFO L272 TraceCheckUtils]: 39: Hoare triple {413#false} call reset_delta_events1(); {454#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:14,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {454#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {412#true} is VALID [2022-02-20 19:59:14,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {412#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {412#true} is VALID [2022-02-20 19:59:14,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,187 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {412#true} {413#false} #1555#return; {413#false} is VALID [2022-02-20 19:59:14,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-02-20 19:59:14,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {413#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {413#false} is VALID [2022-02-20 19:59:14,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-02-20 19:59:14,188 INFO L272 TraceCheckUtils]: 47: Hoare triple {413#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {412#true} is VALID [2022-02-20 19:59:14,188 INFO L290 TraceCheckUtils]: 48: Hoare triple {412#true} havoc ~__retres1~2; {412#true} is VALID [2022-02-20 19:59:14,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {412#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {412#true} is VALID [2022-02-20 19:59:14,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {412#true} #res := ~__retres1~2; {412#true} is VALID [2022-02-20 19:59:14,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {412#true} assume true; {412#true} is VALID [2022-02-20 19:59:14,189 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {412#true} {413#false} #1557#return; {413#false} is VALID [2022-02-20 19:59:14,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {413#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {413#false} is VALID [2022-02-20 19:59:14,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {413#false} assume 0 != eval1_~tmp___1~0#1; {413#false} is VALID [2022-02-20 19:59:14,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {413#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {413#false} is VALID [2022-02-20 19:59:14,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {413#false} assume !(0 != eval1_~tmp~2#1); {413#false} is VALID [2022-02-20 19:59:14,190 INFO L272 TraceCheckUtils]: 57: Hoare triple {413#false} call error1(); {413#false} is VALID [2022-02-20 19:59:14,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-02-20 19:59:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:14,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:14,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768459325] [2022-02-20 19:59:14,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768459325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:14,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:14,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:14,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724354312] [2022-02-20 19:59:14,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:14,198 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-02-20 19:59:14,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:14,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 19:59:14,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:14,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:14,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:14,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:14,260 INFO L87 Difference]: Start difference. First operand has 409 states, 354 states have (on average 1.6271186440677967) internal successors, (576), 361 states have internal predecessors, (576), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) 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-02-20 19:59:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:17,291 INFO L93 Difference]: Finished difference Result 929 states and 1470 transitions. [2022-02-20 19:59:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:17,291 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-02-20 19:59:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1470 transitions. [2022-02-20 19:59:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1470 transitions. [2022-02-20 19:59:17,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1470 transitions. [2022-02-20 19:59:18,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1470 edges. 1470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,316 INFO L225 Difference]: With dead ends: 929 [2022-02-20 19:59:18,317 INFO L226 Difference]: Without dead ends: 535 [2022-02-20 19:59:18,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:18,323 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 734 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2319 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:18,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 2319 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-02-20 19:59:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 495. [2022-02-20 19:59:18,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:18,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 535 states. Second operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:59:18,371 INFO L74 IsIncluded]: Start isIncluded. First operand 535 states. Second operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:59:18,372 INFO L87 Difference]: Start difference. First operand 535 states. Second operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:59:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,395 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2022-02-20 19:59:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 792 transitions. [2022-02-20 19:59:18,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:18,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:18,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 535 states. [2022-02-20 19:59:18,402 INFO L87 Difference]: Start difference. First operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 535 states. [2022-02-20 19:59:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,421 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2022-02-20 19:59:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 792 transitions. [2022-02-20 19:59:18,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:18,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:18,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:18,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:59:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 737 transitions. [2022-02-20 19:59:18,444 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 737 transitions. Word has length 59 [2022-02-20 19:59:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:18,444 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 737 transitions. [2022-02-20 19:59:18,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 737 transitions. [2022-02-20 19:59:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:18,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:18,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:18,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:18,450 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1346424911, now seen corresponding path program 1 times [2022-02-20 19:59:18,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:18,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608017475] [2022-02-20 19:59:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:18,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {3492#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3454#(= ~q_write_ev~0 ~q_read_ev~0)} #1549#return; {3454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {3494#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:18,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3495#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:18,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {3495#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3495#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:18,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3495#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3454#(= ~q_write_ev~0 ~q_read_ev~0)} #1551#return; {3453#false} is VALID [2022-02-20 19:59:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {3452#true} havoc ~__retres1~0; {3452#true} is VALID [2022-02-20 19:59:18,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {3452#true} assume !(1 == ~p_dw_pc~0); {3452#true} is VALID [2022-02-20 19:59:18,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {3452#true} ~__retres1~0 := 0; {3452#true} is VALID [2022-02-20 19:59:18,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {3452#true} #res := ~__retres1~0; {3452#true} is VALID [2022-02-20 19:59:18,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,556 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3452#true} {3452#true} #1545#return; {3452#true} is VALID [2022-02-20 19:59:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {3452#true} havoc ~__retres1~1; {3452#true} is VALID [2022-02-20 19:59:18,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3452#true} assume !(1 == ~c_dr_pc~0); {3452#true} is VALID [2022-02-20 19:59:18,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {3452#true} ~__retres1~1 := 0; {3452#true} is VALID [2022-02-20 19:59:18,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {3452#true} #res := ~__retres1~1; {3452#true} is VALID [2022-02-20 19:59:18,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,560 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3452#true} {3452#true} #1547#return; {3452#true} is VALID [2022-02-20 19:59:18,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {3496#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {3452#true} is VALID [2022-02-20 19:59:18,560 INFO L272 TraceCheckUtils]: 1: Hoare triple {3452#true} call #t~ret8 := is_do_write_p_triggered(); {3452#true} is VALID [2022-02-20 19:59:18,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {3452#true} havoc ~__retres1~0; {3452#true} is VALID [2022-02-20 19:59:18,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {3452#true} assume !(1 == ~p_dw_pc~0); {3452#true} is VALID [2022-02-20 19:59:18,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {3452#true} ~__retres1~0 := 0; {3452#true} is VALID [2022-02-20 19:59:18,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {3452#true} #res := ~__retres1~0; {3452#true} is VALID [2022-02-20 19:59:18,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,561 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3452#true} {3452#true} #1545#return; {3452#true} is VALID [2022-02-20 19:59:18,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {3452#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3452#true} is VALID [2022-02-20 19:59:18,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {3452#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3452#true} is VALID [2022-02-20 19:59:18,562 INFO L272 TraceCheckUtils]: 10: Hoare triple {3452#true} call #t~ret9 := is_do_read_c_triggered(); {3452#true} is VALID [2022-02-20 19:59:18,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {3452#true} havoc ~__retres1~1; {3452#true} is VALID [2022-02-20 19:59:18,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {3452#true} assume !(1 == ~c_dr_pc~0); {3452#true} is VALID [2022-02-20 19:59:18,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {3452#true} ~__retres1~1 := 0; {3452#true} is VALID [2022-02-20 19:59:18,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {3452#true} #res := ~__retres1~1; {3452#true} is VALID [2022-02-20 19:59:18,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,563 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3452#true} {3452#true} #1547#return; {3452#true} is VALID [2022-02-20 19:59:18,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {3452#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3452#true} is VALID [2022-02-20 19:59:18,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {3452#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3452#true} is VALID [2022-02-20 19:59:18,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,563 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3452#true} {3453#false} #1553#return; {3453#false} is VALID [2022-02-20 19:59:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {3452#true} is VALID [2022-02-20 19:59:18,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {3452#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3452#true} is VALID [2022-02-20 19:59:18,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3452#true} {3453#false} #1555#return; {3453#false} is VALID [2022-02-20 19:59:18,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {3452#true} havoc ~__retres1~2; {3452#true} is VALID [2022-02-20 19:59:18,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {3452#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3452#true} is VALID [2022-02-20 19:59:18,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {3452#true} #res := ~__retres1~2; {3452#true} is VALID [2022-02-20 19:59:18,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,573 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3452#true} {3453#false} #1557#return; {3453#false} is VALID [2022-02-20 19:59:18,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {3452#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {3452#true} is VALID [2022-02-20 19:59:18,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {3452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {3452#true} is VALID [2022-02-20 19:59:18,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {3452#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {3454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {3454#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {3454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {3454#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3492#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:18,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {3492#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,576 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3454#(= ~q_write_ev~0 ~q_read_ev~0)} #1549#return; {3454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {3454#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {3454#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {3454#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {3454#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,578 INFO L272 TraceCheckUtils]: 12: Hoare triple {3454#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {3494#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:18,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3495#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:18,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {3495#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3495#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:18,579 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3495#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3454#(= ~q_write_ev~0 ~q_read_ev~0)} #1551#return; {3453#false} is VALID [2022-02-20 19:59:18,580 INFO L272 TraceCheckUtils]: 17: Hoare triple {3453#false} call activate_threads1(); {3496#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:18,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {3496#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {3452#true} is VALID [2022-02-20 19:59:18,580 INFO L272 TraceCheckUtils]: 19: Hoare triple {3452#true} call #t~ret8 := is_do_write_p_triggered(); {3452#true} is VALID [2022-02-20 19:59:18,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {3452#true} havoc ~__retres1~0; {3452#true} is VALID [2022-02-20 19:59:18,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {3452#true} assume !(1 == ~p_dw_pc~0); {3452#true} is VALID [2022-02-20 19:59:18,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {3452#true} ~__retres1~0 := 0; {3452#true} is VALID [2022-02-20 19:59:18,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {3452#true} #res := ~__retres1~0; {3452#true} is VALID [2022-02-20 19:59:18,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,581 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3452#true} {3452#true} #1545#return; {3452#true} is VALID [2022-02-20 19:59:18,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {3452#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3452#true} is VALID [2022-02-20 19:59:18,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {3452#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3452#true} is VALID [2022-02-20 19:59:18,581 INFO L272 TraceCheckUtils]: 28: Hoare triple {3452#true} call #t~ret9 := is_do_read_c_triggered(); {3452#true} is VALID [2022-02-20 19:59:18,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {3452#true} havoc ~__retres1~1; {3452#true} is VALID [2022-02-20 19:59:18,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {3452#true} assume !(1 == ~c_dr_pc~0); {3452#true} is VALID [2022-02-20 19:59:18,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#true} ~__retres1~1 := 0; {3452#true} is VALID [2022-02-20 19:59:18,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {3452#true} #res := ~__retres1~1; {3452#true} is VALID [2022-02-20 19:59:18,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,582 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3452#true} {3452#true} #1547#return; {3452#true} is VALID [2022-02-20 19:59:18,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3452#true} is VALID [2022-02-20 19:59:18,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {3452#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3452#true} is VALID [2022-02-20 19:59:18,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,583 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3452#true} {3453#false} #1553#return; {3453#false} is VALID [2022-02-20 19:59:18,583 INFO L272 TraceCheckUtils]: 39: Hoare triple {3453#false} call reset_delta_events1(); {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {3493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {3452#true} is VALID [2022-02-20 19:59:18,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {3452#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3452#true} is VALID [2022-02-20 19:59:18,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,583 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3452#true} {3453#false} #1555#return; {3453#false} is VALID [2022-02-20 19:59:18,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {3453#false} assume !false; {3453#false} is VALID [2022-02-20 19:59:18,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {3453#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {3453#false} is VALID [2022-02-20 19:59:18,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {3453#false} assume !false; {3453#false} is VALID [2022-02-20 19:59:18,584 INFO L272 TraceCheckUtils]: 47: Hoare triple {3453#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3452#true} is VALID [2022-02-20 19:59:18,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {3452#true} havoc ~__retres1~2; {3452#true} is VALID [2022-02-20 19:59:18,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {3452#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3452#true} is VALID [2022-02-20 19:59:18,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {3452#true} #res := ~__retres1~2; {3452#true} is VALID [2022-02-20 19:59:18,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {3452#true} assume true; {3452#true} is VALID [2022-02-20 19:59:18,585 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3452#true} {3453#false} #1557#return; {3453#false} is VALID [2022-02-20 19:59:18,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {3453#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3453#false} is VALID [2022-02-20 19:59:18,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {3453#false} assume 0 != eval1_~tmp___1~0#1; {3453#false} is VALID [2022-02-20 19:59:18,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {3453#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3453#false} is VALID [2022-02-20 19:59:18,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {3453#false} assume !(0 != eval1_~tmp~2#1); {3453#false} is VALID [2022-02-20 19:59:18,585 INFO L272 TraceCheckUtils]: 57: Hoare triple {3453#false} call error1(); {3453#false} is VALID [2022-02-20 19:59:18,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {3453#false} assume !false; {3453#false} is VALID [2022-02-20 19:59:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:18,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:18,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608017475] [2022-02-20 19:59:18,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608017475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:18,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:18,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:18,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820781376] [2022-02-20 19:59:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:18,588 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-02-20 19:59:18,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:18,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 19:59:18,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:18,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:18,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:18,623 INFO L87 Difference]: Start difference. First operand 495 states and 737 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-02-20 19:59:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:21,692 INFO L93 Difference]: Finished difference Result 844 states and 1216 transitions. [2022-02-20 19:59:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:21,693 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-02-20 19:59:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 945 transitions. [2022-02-20 19:59:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 945 transitions. [2022-02-20 19:59:21,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 945 transitions. [2022-02-20 19:59:22,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 945 edges. 945 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:22,410 INFO L225 Difference]: With dead ends: 844 [2022-02-20 19:59:22,410 INFO L226 Difference]: Without dead ends: 666 [2022-02-20 19:59:22,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:22,416 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 1442 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:22,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1984 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:22,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-02-20 19:59:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 591. [2022-02-20 19:59:22,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:22,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states. Second operand has 591 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 507 states have internal predecessors, (741), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:22,457 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states. Second operand has 591 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 507 states have internal predecessors, (741), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:22,460 INFO L87 Difference]: Start difference. First operand 666 states. Second operand has 591 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 507 states have internal predecessors, (741), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,492 INFO L93 Difference]: Finished difference Result 666 states and 975 transitions. [2022-02-20 19:59:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 975 transitions. [2022-02-20 19:59:22,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 591 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 507 states have internal predecessors, (741), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 666 states. [2022-02-20 19:59:22,498 INFO L87 Difference]: Start difference. First operand has 591 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 507 states have internal predecessors, (741), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 666 states. [2022-02-20 19:59:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,519 INFO L93 Difference]: Finished difference Result 666 states and 975 transitions. [2022-02-20 19:59:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 975 transitions. [2022-02-20 19:59:22,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:22,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 507 states have internal predecessors, (741), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 871 transitions. [2022-02-20 19:59:22,544 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 871 transitions. Word has length 59 [2022-02-20 19:59:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:22,545 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 871 transitions. [2022-02-20 19:59:22,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 871 transitions. [2022-02-20 19:59:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:22,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:22,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:22,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:22,547 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash -452938573, now seen corresponding path program 1 times [2022-02-20 19:59:22,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:22,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485331254] [2022-02-20 19:59:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {6824#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {6785#true} is VALID [2022-02-20 19:59:22,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6785#true} {6785#true} #1549#return; {6785#true} is VALID [2022-02-20 19:59:22,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {6825#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {6785#true} is VALID [2022-02-20 19:59:22,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#true} assume !(0 == ~q_write_ev~0); {6785#true} is VALID [2022-02-20 19:59:22,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6785#true} {6785#true} #1551#return; {6785#true} is VALID [2022-02-20 19:59:22,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {6785#true} havoc ~__retres1~0; {6785#true} is VALID [2022-02-20 19:59:22,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#true} assume !(1 == ~p_dw_pc~0); {6785#true} is VALID [2022-02-20 19:59:22,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {6785#true} ~__retres1~0 := 0; {6841#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:22,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {6841#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:22,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:22,667 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6785#true} #1545#return; {6833#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {6785#true} havoc ~__retres1~1; {6785#true} is VALID [2022-02-20 19:59:22,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#true} assume !(1 == ~c_dr_pc~0); {6785#true} is VALID [2022-02-20 19:59:22,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {6785#true} ~__retres1~1 := 0; {6785#true} is VALID [2022-02-20 19:59:22,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {6785#true} #res := ~__retres1~1; {6785#true} is VALID [2022-02-20 19:59:22,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,671 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6785#true} {6786#false} #1547#return; {6786#false} is VALID [2022-02-20 19:59:22,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {6826#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {6785#true} is VALID [2022-02-20 19:59:22,671 INFO L272 TraceCheckUtils]: 1: Hoare triple {6785#true} call #t~ret8 := is_do_write_p_triggered(); {6785#true} is VALID [2022-02-20 19:59:22,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {6785#true} havoc ~__retres1~0; {6785#true} is VALID [2022-02-20 19:59:22,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {6785#true} assume !(1 == ~p_dw_pc~0); {6785#true} is VALID [2022-02-20 19:59:22,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {6785#true} ~__retres1~0 := 0; {6841#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:22,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {6841#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:22,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:22,673 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6785#true} #1545#return; {6833#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:22,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {6833#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6834#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:22,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {6834#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6786#false} is VALID [2022-02-20 19:59:22,674 INFO L272 TraceCheckUtils]: 10: Hoare triple {6786#false} call #t~ret9 := is_do_read_c_triggered(); {6785#true} is VALID [2022-02-20 19:59:22,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {6785#true} havoc ~__retres1~1; {6785#true} is VALID [2022-02-20 19:59:22,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {6785#true} assume !(1 == ~c_dr_pc~0); {6785#true} is VALID [2022-02-20 19:59:22,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {6785#true} ~__retres1~1 := 0; {6785#true} is VALID [2022-02-20 19:59:22,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {6785#true} #res := ~__retres1~1; {6785#true} is VALID [2022-02-20 19:59:22,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,674 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6785#true} {6786#false} #1547#return; {6786#false} is VALID [2022-02-20 19:59:22,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {6786#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6786#false} is VALID [2022-02-20 19:59:22,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {6786#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6786#false} is VALID [2022-02-20 19:59:22,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {6786#false} assume true; {6786#false} is VALID [2022-02-20 19:59:22,675 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6786#false} {6785#true} #1553#return; {6786#false} is VALID [2022-02-20 19:59:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {6825#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {6785#true} is VALID [2022-02-20 19:59:22,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6785#true} is VALID [2022-02-20 19:59:22,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6785#true} {6786#false} #1555#return; {6786#false} is VALID [2022-02-20 19:59:22,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {6785#true} havoc ~__retres1~2; {6785#true} is VALID [2022-02-20 19:59:22,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6785#true} is VALID [2022-02-20 19:59:22,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {6785#true} #res := ~__retres1~2; {6785#true} is VALID [2022-02-20 19:59:22,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,697 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6785#true} {6786#false} #1557#return; {6786#false} is VALID [2022-02-20 19:59:22,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {6785#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {6785#true} is VALID [2022-02-20 19:59:22,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {6785#true} is VALID [2022-02-20 19:59:22,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {6785#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {6785#true} is VALID [2022-02-20 19:59:22,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {6785#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {6785#true} is VALID [2022-02-20 19:59:22,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {6785#true} call update_channels1(); {6824#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:22,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {6824#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {6785#true} is VALID [2022-02-20 19:59:22,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,698 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6785#true} {6785#true} #1549#return; {6785#true} is VALID [2022-02-20 19:59:22,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {6785#true} assume { :begin_inline_init_threads1 } true; {6785#true} is VALID [2022-02-20 19:59:22,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {6785#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6785#true} is VALID [2022-02-20 19:59:22,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {6785#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6785#true} is VALID [2022-02-20 19:59:22,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {6785#true} assume { :end_inline_init_threads1 } true; {6785#true} is VALID [2022-02-20 19:59:22,699 INFO L272 TraceCheckUtils]: 12: Hoare triple {6785#true} call fire_delta_events1(); {6825#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {6825#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {6785#true} is VALID [2022-02-20 19:59:22,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {6785#true} assume !(0 == ~q_write_ev~0); {6785#true} is VALID [2022-02-20 19:59:22,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,699 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6785#true} {6785#true} #1551#return; {6785#true} is VALID [2022-02-20 19:59:22,700 INFO L272 TraceCheckUtils]: 17: Hoare triple {6785#true} call activate_threads1(); {6826#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:22,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {6826#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {6785#true} is VALID [2022-02-20 19:59:22,700 INFO L272 TraceCheckUtils]: 19: Hoare triple {6785#true} call #t~ret8 := is_do_write_p_triggered(); {6785#true} is VALID [2022-02-20 19:59:22,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {6785#true} havoc ~__retres1~0; {6785#true} is VALID [2022-02-20 19:59:22,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {6785#true} assume !(1 == ~p_dw_pc~0); {6785#true} is VALID [2022-02-20 19:59:22,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {6785#true} ~__retres1~0 := 0; {6841#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:22,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {6841#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:22,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:22,701 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6842#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6785#true} #1545#return; {6833#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:22,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {6833#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6834#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:22,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {6834#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6786#false} is VALID [2022-02-20 19:59:22,702 INFO L272 TraceCheckUtils]: 28: Hoare triple {6786#false} call #t~ret9 := is_do_read_c_triggered(); {6785#true} is VALID [2022-02-20 19:59:22,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {6785#true} havoc ~__retres1~1; {6785#true} is VALID [2022-02-20 19:59:22,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {6785#true} assume !(1 == ~c_dr_pc~0); {6785#true} is VALID [2022-02-20 19:59:22,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {6785#true} ~__retres1~1 := 0; {6785#true} is VALID [2022-02-20 19:59:22,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {6785#true} #res := ~__retres1~1; {6785#true} is VALID [2022-02-20 19:59:22,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,702 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6785#true} {6786#false} #1547#return; {6786#false} is VALID [2022-02-20 19:59:22,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {6786#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6786#false} is VALID [2022-02-20 19:59:22,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {6786#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6786#false} is VALID [2022-02-20 19:59:22,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {6786#false} assume true; {6786#false} is VALID [2022-02-20 19:59:22,703 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6786#false} {6785#true} #1553#return; {6786#false} is VALID [2022-02-20 19:59:22,703 INFO L272 TraceCheckUtils]: 39: Hoare triple {6786#false} call reset_delta_events1(); {6825#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {6825#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {6785#true} is VALID [2022-02-20 19:59:22,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {6785#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6785#true} is VALID [2022-02-20 19:59:22,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,703 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6785#true} {6786#false} #1555#return; {6786#false} is VALID [2022-02-20 19:59:22,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2022-02-20 19:59:22,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {6786#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {6786#false} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2022-02-20 19:59:22,704 INFO L272 TraceCheckUtils]: 47: Hoare triple {6786#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6785#true} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {6785#true} havoc ~__retres1~2; {6785#true} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {6785#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6785#true} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {6785#true} #res := ~__retres1~2; {6785#true} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {6785#true} assume true; {6785#true} is VALID [2022-02-20 19:59:22,704 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6785#true} {6786#false} #1557#return; {6786#false} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {6786#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {6786#false} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {6786#false} assume 0 != eval1_~tmp___1~0#1; {6786#false} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {6786#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {6786#false} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {6786#false} assume !(0 != eval1_~tmp~2#1); {6786#false} is VALID [2022-02-20 19:59:22,704 INFO L272 TraceCheckUtils]: 57: Hoare triple {6786#false} call error1(); {6786#false} is VALID [2022-02-20 19:59:22,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2022-02-20 19:59:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:22,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:22,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485331254] [2022-02-20 19:59:22,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485331254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:22,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:22,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:22,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2171646] [2022-02-20 19:59:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:22,706 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-02-20 19:59:22,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:22,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 19:59:22,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:22,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:22,748 INFO L87 Difference]: Start difference. First operand 591 states and 871 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-02-20 19:59:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:25,489 INFO L93 Difference]: Finished difference Result 893 states and 1286 transitions. [2022-02-20 19:59:25,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:25,490 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-02-20 19:59:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 762 transitions. [2022-02-20 19:59:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 762 transitions. [2022-02-20 19:59:25,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 762 transitions. [2022-02-20 19:59:25,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 762 edges. 762 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:25,975 INFO L225 Difference]: With dead ends: 893 [2022-02-20 19:59:25,975 INFO L226 Difference]: Without dead ends: 625 [2022-02-20 19:59:25,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:25,983 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 788 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2356 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:25,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 2356 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-02-20 19:59:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 596. [2022-02-20 19:59:26,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:26,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 625 states. Second operand has 596 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 511 states have internal predecessors, (743), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:59:26,017 INFO L74 IsIncluded]: Start isIncluded. First operand 625 states. Second operand has 596 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 511 states have internal predecessors, (743), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:59:26,018 INFO L87 Difference]: Start difference. First operand 625 states. Second operand has 596 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 511 states have internal predecessors, (743), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:59:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,036 INFO L93 Difference]: Finished difference Result 625 states and 915 transitions. [2022-02-20 19:59:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 915 transitions. [2022-02-20 19:59:26,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 596 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 511 states have internal predecessors, (743), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) Second operand 625 states. [2022-02-20 19:59:26,040 INFO L87 Difference]: Start difference. First operand has 596 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 511 states have internal predecessors, (743), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) Second operand 625 states. [2022-02-20 19:59:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,063 INFO L93 Difference]: Finished difference Result 625 states and 915 transitions. [2022-02-20 19:59:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 915 transitions. [2022-02-20 19:59:26,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:26,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 511 states have internal predecessors, (743), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:59:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 874 transitions. [2022-02-20 19:59:26,087 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 874 transitions. Word has length 59 [2022-02-20 19:59:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:26,087 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 874 transitions. [2022-02-20 19:59:26,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 874 transitions. [2022-02-20 19:59:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:26,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:26,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:26,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:26,089 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash -178178959, now seen corresponding path program 1 times [2022-02-20 19:59:26,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:26,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239063370] [2022-02-20 19:59:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {10138#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {10099#true} is VALID [2022-02-20 19:59:26,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10099#true} {10099#true} #1549#return; {10099#true} is VALID [2022-02-20 19:59:26,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {10139#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {10099#true} is VALID [2022-02-20 19:59:26,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {10099#true} assume !(0 == ~q_write_ev~0); {10099#true} is VALID [2022-02-20 19:59:26,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10099#true} {10099#true} #1551#return; {10099#true} is VALID [2022-02-20 19:59:26,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {10099#true} havoc ~__retres1~0; {10099#true} is VALID [2022-02-20 19:59:26,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {10099#true} assume !(1 == ~p_dw_pc~0); {10099#true} is VALID [2022-02-20 19:59:26,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {10099#true} ~__retres1~0 := 0; {10099#true} is VALID [2022-02-20 19:59:26,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {10099#true} #res := ~__retres1~0; {10099#true} is VALID [2022-02-20 19:59:26,217 INFO L290 TraceCheckUtils]: 4: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,217 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10099#true} {10099#true} #1545#return; {10099#true} is VALID [2022-02-20 19:59:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {10099#true} havoc ~__retres1~1; {10099#true} is VALID [2022-02-20 19:59:26,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {10099#true} assume !(1 == ~c_dr_pc~0); {10099#true} is VALID [2022-02-20 19:59:26,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {10099#true} ~__retres1~1 := 0; {10155#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:26,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {10155#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,251 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10099#true} #1547#return; {10153#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:26,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {10140#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {10099#true} is VALID [2022-02-20 19:59:26,251 INFO L272 TraceCheckUtils]: 1: Hoare triple {10099#true} call #t~ret8 := is_do_write_p_triggered(); {10099#true} is VALID [2022-02-20 19:59:26,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {10099#true} havoc ~__retres1~0; {10099#true} is VALID [2022-02-20 19:59:26,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {10099#true} assume !(1 == ~p_dw_pc~0); {10099#true} is VALID [2022-02-20 19:59:26,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {10099#true} ~__retres1~0 := 0; {10099#true} is VALID [2022-02-20 19:59:26,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {10099#true} #res := ~__retres1~0; {10099#true} is VALID [2022-02-20 19:59:26,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,252 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10099#true} {10099#true} #1545#return; {10099#true} is VALID [2022-02-20 19:59:26,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {10099#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10099#true} is VALID [2022-02-20 19:59:26,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {10099#true} assume !(0 != ~tmp~1); {10099#true} is VALID [2022-02-20 19:59:26,253 INFO L272 TraceCheckUtils]: 10: Hoare triple {10099#true} call #t~ret9 := is_do_read_c_triggered(); {10099#true} is VALID [2022-02-20 19:59:26,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {10099#true} havoc ~__retres1~1; {10099#true} is VALID [2022-02-20 19:59:26,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {10099#true} assume !(1 == ~c_dr_pc~0); {10099#true} is VALID [2022-02-20 19:59:26,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {10099#true} ~__retres1~1 := 0; {10155#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:26,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {10155#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,254 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10099#true} #1547#return; {10153#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:26,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {10153#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10154#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:26,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {10154#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10100#false} is VALID [2022-02-20 19:59:26,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {10100#false} assume true; {10100#false} is VALID [2022-02-20 19:59:26,256 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10100#false} {10099#true} #1553#return; {10100#false} is VALID [2022-02-20 19:59:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {10139#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {10099#true} is VALID [2022-02-20 19:59:26,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {10099#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10099#true} is VALID [2022-02-20 19:59:26,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10099#true} {10100#false} #1555#return; {10100#false} is VALID [2022-02-20 19:59:26,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {10099#true} havoc ~__retres1~2; {10099#true} is VALID [2022-02-20 19:59:26,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {10099#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10099#true} is VALID [2022-02-20 19:59:26,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {10099#true} #res := ~__retres1~2; {10099#true} is VALID [2022-02-20 19:59:26,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,266 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10099#true} {10100#false} #1557#return; {10100#false} is VALID [2022-02-20 19:59:26,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {10099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {10099#true} is VALID [2022-02-20 19:59:26,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {10099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {10099#true} is VALID [2022-02-20 19:59:26,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {10099#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {10099#true} is VALID [2022-02-20 19:59:26,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {10099#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {10099#true} is VALID [2022-02-20 19:59:26,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {10099#true} call update_channels1(); {10138#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:26,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {10138#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {10099#true} is VALID [2022-02-20 19:59:26,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,276 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10099#true} {10099#true} #1549#return; {10099#true} is VALID [2022-02-20 19:59:26,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {10099#true} assume { :begin_inline_init_threads1 } true; {10099#true} is VALID [2022-02-20 19:59:26,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {10099#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10099#true} is VALID [2022-02-20 19:59:26,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {10099#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10099#true} is VALID [2022-02-20 19:59:26,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {10099#true} assume { :end_inline_init_threads1 } true; {10099#true} is VALID [2022-02-20 19:59:26,285 INFO L272 TraceCheckUtils]: 12: Hoare triple {10099#true} call fire_delta_events1(); {10139#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:26,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {10139#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {10099#true} is VALID [2022-02-20 19:59:26,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {10099#true} assume !(0 == ~q_write_ev~0); {10099#true} is VALID [2022-02-20 19:59:26,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,285 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10099#true} {10099#true} #1551#return; {10099#true} is VALID [2022-02-20 19:59:26,286 INFO L272 TraceCheckUtils]: 17: Hoare triple {10099#true} call activate_threads1(); {10140#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:26,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {10140#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {10099#true} is VALID [2022-02-20 19:59:26,286 INFO L272 TraceCheckUtils]: 19: Hoare triple {10099#true} call #t~ret8 := is_do_write_p_triggered(); {10099#true} is VALID [2022-02-20 19:59:26,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {10099#true} havoc ~__retres1~0; {10099#true} is VALID [2022-02-20 19:59:26,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {10099#true} assume !(1 == ~p_dw_pc~0); {10099#true} is VALID [2022-02-20 19:59:26,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {10099#true} ~__retres1~0 := 0; {10099#true} is VALID [2022-02-20 19:59:26,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {10099#true} #res := ~__retres1~0; {10099#true} is VALID [2022-02-20 19:59:26,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,287 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10099#true} {10099#true} #1545#return; {10099#true} is VALID [2022-02-20 19:59:26,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {10099#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10099#true} is VALID [2022-02-20 19:59:26,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {10099#true} assume !(0 != ~tmp~1); {10099#true} is VALID [2022-02-20 19:59:26,287 INFO L272 TraceCheckUtils]: 28: Hoare triple {10099#true} call #t~ret9 := is_do_read_c_triggered(); {10099#true} is VALID [2022-02-20 19:59:26,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {10099#true} havoc ~__retres1~1; {10099#true} is VALID [2022-02-20 19:59:26,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {10099#true} assume !(1 == ~c_dr_pc~0); {10099#true} is VALID [2022-02-20 19:59:26,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {10099#true} ~__retres1~1 := 0; {10155#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:26,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {10155#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,289 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10156#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10099#true} #1547#return; {10153#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:26,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {10153#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10154#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:26,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {10154#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10100#false} is VALID [2022-02-20 19:59:26,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {10100#false} assume true; {10100#false} is VALID [2022-02-20 19:59:26,291 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10100#false} {10099#true} #1553#return; {10100#false} is VALID [2022-02-20 19:59:26,291 INFO L272 TraceCheckUtils]: 39: Hoare triple {10100#false} call reset_delta_events1(); {10139#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:26,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {10139#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {10099#true} is VALID [2022-02-20 19:59:26,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {10099#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10099#true} is VALID [2022-02-20 19:59:26,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,291 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10099#true} {10100#false} #1555#return; {10100#false} is VALID [2022-02-20 19:59:26,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {10100#false} assume !false; {10100#false} is VALID [2022-02-20 19:59:26,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {10100#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {10100#false} is VALID [2022-02-20 19:59:26,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {10100#false} assume !false; {10100#false} is VALID [2022-02-20 19:59:26,292 INFO L272 TraceCheckUtils]: 47: Hoare triple {10100#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10099#true} is VALID [2022-02-20 19:59:26,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {10099#true} havoc ~__retres1~2; {10099#true} is VALID [2022-02-20 19:59:26,292 INFO L290 TraceCheckUtils]: 49: Hoare triple {10099#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10099#true} is VALID [2022-02-20 19:59:26,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {10099#true} #res := ~__retres1~2; {10099#true} is VALID [2022-02-20 19:59:26,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {10099#true} assume true; {10099#true} is VALID [2022-02-20 19:59:26,293 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10099#true} {10100#false} #1557#return; {10100#false} is VALID [2022-02-20 19:59:26,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {10100#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {10100#false} is VALID [2022-02-20 19:59:26,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {10100#false} assume 0 != eval1_~tmp___1~0#1; {10100#false} is VALID [2022-02-20 19:59:26,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {10100#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {10100#false} is VALID [2022-02-20 19:59:26,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {10100#false} assume !(0 != eval1_~tmp~2#1); {10100#false} is VALID [2022-02-20 19:59:26,294 INFO L272 TraceCheckUtils]: 57: Hoare triple {10100#false} call error1(); {10100#false} is VALID [2022-02-20 19:59:26,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {10100#false} assume !false; {10100#false} is VALID [2022-02-20 19:59:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:26,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:26,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239063370] [2022-02-20 19:59:26,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239063370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:26,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:26,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:26,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772877969] [2022-02-20 19:59:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:26,296 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-02-20 19:59:26,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:26,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 19:59:26,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:26,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:26,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:26,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:26,330 INFO L87 Difference]: Start difference. First operand 596 states and 874 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-02-20 19:59:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:29,003 INFO L93 Difference]: Finished difference Result 915 states and 1308 transitions. [2022-02-20 19:59:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:29,004 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-02-20 19:59:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 766 transitions. [2022-02-20 19:59:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 766 transitions. [2022-02-20 19:59:29,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 766 transitions. [2022-02-20 19:59:29,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 766 edges. 766 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:29,716 INFO L225 Difference]: With dead ends: 915 [2022-02-20 19:59:29,717 INFO L226 Difference]: Without dead ends: 642 [2022-02-20 19:59:29,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:29,722 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 789 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:29,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 2353 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-02-20 19:59:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 611. [2022-02-20 19:59:29,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:29,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 642 states. Second operand has 611 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 523 states have internal predecessors, (755), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:59:29,752 INFO L74 IsIncluded]: Start isIncluded. First operand 642 states. Second operand has 611 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 523 states have internal predecessors, (755), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:59:29,753 INFO L87 Difference]: Start difference. First operand 642 states. Second operand has 611 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 523 states have internal predecessors, (755), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:59:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:29,771 INFO L93 Difference]: Finished difference Result 642 states and 933 transitions. [2022-02-20 19:59:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 933 transitions. [2022-02-20 19:59:29,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:29,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:29,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 611 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 523 states have internal predecessors, (755), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) Second operand 642 states. [2022-02-20 19:59:29,776 INFO L87 Difference]: Start difference. First operand has 611 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 523 states have internal predecessors, (755), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) Second operand 642 states. [2022-02-20 19:59:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:29,795 INFO L93 Difference]: Finished difference Result 642 states and 933 transitions. [2022-02-20 19:59:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 933 transitions. [2022-02-20 19:59:29,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:29,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:29,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:29,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 523 states have internal predecessors, (755), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:59:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 889 transitions. [2022-02-20 19:59:29,819 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 889 transitions. Word has length 59 [2022-02-20 19:59:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:29,819 INFO L470 AbstractCegarLoop]: Abstraction has 611 states and 889 transitions. [2022-02-20 19:59:29,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 889 transitions. [2022-02-20 19:59:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:29,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:29,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:29,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:29,822 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1983617293, now seen corresponding path program 1 times [2022-02-20 19:59:29,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:29,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64324191] [2022-02-20 19:59:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {13533#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13495#(= ~q_write_ev~0 ~q_read_ev~0)} #1549#return; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13495#(= ~q_write_ev~0 ~q_read_ev~0)} #1551#return; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {13493#true} havoc ~__retres1~0; {13493#true} is VALID [2022-02-20 19:59:29,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {13493#true} assume !(1 == ~p_dw_pc~0); {13493#true} is VALID [2022-02-20 19:59:29,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {13493#true} ~__retres1~0 := 0; {13493#true} is VALID [2022-02-20 19:59:29,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {13493#true} #res := ~__retres1~0; {13493#true} is VALID [2022-02-20 19:59:29,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,928 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13493#true} {13493#true} #1545#return; {13493#true} is VALID [2022-02-20 19:59:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {13493#true} havoc ~__retres1~1; {13493#true} is VALID [2022-02-20 19:59:29,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {13493#true} assume !(1 == ~c_dr_pc~0); {13493#true} is VALID [2022-02-20 19:59:29,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {13493#true} ~__retres1~1 := 0; {13493#true} is VALID [2022-02-20 19:59:29,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {13493#true} #res := ~__retres1~1; {13493#true} is VALID [2022-02-20 19:59:29,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,933 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13493#true} {13493#true} #1547#return; {13493#true} is VALID [2022-02-20 19:59:29,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {13535#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {13493#true} is VALID [2022-02-20 19:59:29,933 INFO L272 TraceCheckUtils]: 1: Hoare triple {13493#true} call #t~ret8 := is_do_write_p_triggered(); {13493#true} is VALID [2022-02-20 19:59:29,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {13493#true} havoc ~__retres1~0; {13493#true} is VALID [2022-02-20 19:59:29,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {13493#true} assume !(1 == ~p_dw_pc~0); {13493#true} is VALID [2022-02-20 19:59:29,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {13493#true} ~__retres1~0 := 0; {13493#true} is VALID [2022-02-20 19:59:29,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {13493#true} #res := ~__retres1~0; {13493#true} is VALID [2022-02-20 19:59:29,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,935 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13493#true} {13493#true} #1545#return; {13493#true} is VALID [2022-02-20 19:59:29,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {13493#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13493#true} is VALID [2022-02-20 19:59:29,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {13493#true} assume !(0 != ~tmp~1); {13493#true} is VALID [2022-02-20 19:59:29,935 INFO L272 TraceCheckUtils]: 10: Hoare triple {13493#true} call #t~ret9 := is_do_read_c_triggered(); {13493#true} is VALID [2022-02-20 19:59:29,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {13493#true} havoc ~__retres1~1; {13493#true} is VALID [2022-02-20 19:59:29,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {13493#true} assume !(1 == ~c_dr_pc~0); {13493#true} is VALID [2022-02-20 19:59:29,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {13493#true} ~__retres1~1 := 0; {13493#true} is VALID [2022-02-20 19:59:29,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {13493#true} #res := ~__retres1~1; {13493#true} is VALID [2022-02-20 19:59:29,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,936 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13493#true} {13493#true} #1547#return; {13493#true} is VALID [2022-02-20 19:59:29,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {13493#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13493#true} is VALID [2022-02-20 19:59:29,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {13493#true} assume !(0 != ~tmp___0~1); {13493#true} is VALID [2022-02-20 19:59:29,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,937 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13493#true} {13495#(= ~q_write_ev~0 ~q_read_ev~0)} #1553#return; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {13548#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:29,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {13548#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13549#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:29,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {13549#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13549#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:29,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13549#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13495#(= ~q_write_ev~0 ~q_read_ev~0)} #1555#return; {13494#false} is VALID [2022-02-20 19:59:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {13493#true} havoc ~__retres1~2; {13493#true} is VALID [2022-02-20 19:59:29,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {13493#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13493#true} is VALID [2022-02-20 19:59:29,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {13493#true} #res := ~__retres1~2; {13493#true} is VALID [2022-02-20 19:59:29,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,962 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13493#true} {13494#false} #1557#return; {13494#false} is VALID [2022-02-20 19:59:29,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {13493#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {13493#true} is VALID [2022-02-20 19:59:29,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {13493#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {13493#true} is VALID [2022-02-20 19:59:29,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {13493#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {13533#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:29,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {13533#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,964 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13495#(= ~q_write_ev~0 ~q_read_ev~0)} #1549#return; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,966 INFO L272 TraceCheckUtils]: 12: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,967 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13495#(= ~q_write_ev~0 ~q_read_ev~0)} #1551#return; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,968 INFO L272 TraceCheckUtils]: 17: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {13535#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:29,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {13535#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {13493#true} is VALID [2022-02-20 19:59:29,968 INFO L272 TraceCheckUtils]: 19: Hoare triple {13493#true} call #t~ret8 := is_do_write_p_triggered(); {13493#true} is VALID [2022-02-20 19:59:29,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {13493#true} havoc ~__retres1~0; {13493#true} is VALID [2022-02-20 19:59:29,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {13493#true} assume !(1 == ~p_dw_pc~0); {13493#true} is VALID [2022-02-20 19:59:29,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {13493#true} ~__retres1~0 := 0; {13493#true} is VALID [2022-02-20 19:59:29,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {13493#true} #res := ~__retres1~0; {13493#true} is VALID [2022-02-20 19:59:29,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,971 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13493#true} {13493#true} #1545#return; {13493#true} is VALID [2022-02-20 19:59:29,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {13493#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13493#true} is VALID [2022-02-20 19:59:29,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {13493#true} assume !(0 != ~tmp~1); {13493#true} is VALID [2022-02-20 19:59:29,971 INFO L272 TraceCheckUtils]: 28: Hoare triple {13493#true} call #t~ret9 := is_do_read_c_triggered(); {13493#true} is VALID [2022-02-20 19:59:29,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {13493#true} havoc ~__retres1~1; {13493#true} is VALID [2022-02-20 19:59:29,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {13493#true} assume !(1 == ~c_dr_pc~0); {13493#true} is VALID [2022-02-20 19:59:29,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {13493#true} ~__retres1~1 := 0; {13493#true} is VALID [2022-02-20 19:59:29,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {13493#true} #res := ~__retres1~1; {13493#true} is VALID [2022-02-20 19:59:29,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,972 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13493#true} {13493#true} #1547#return; {13493#true} is VALID [2022-02-20 19:59:29,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {13493#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13493#true} is VALID [2022-02-20 19:59:29,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {13493#true} assume !(0 != ~tmp___0~1); {13493#true} is VALID [2022-02-20 19:59:29,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,973 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13493#true} {13495#(= ~q_write_ev~0 ~q_read_ev~0)} #1553#return; {13495#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,973 INFO L272 TraceCheckUtils]: 39: Hoare triple {13495#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:29,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {13534#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {13548#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:29,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {13548#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13549#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:29,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {13549#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13549#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:29,974 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13549#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13495#(= ~q_write_ev~0 ~q_read_ev~0)} #1555#return; {13494#false} is VALID [2022-02-20 19:59:29,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {13494#false} assume !false; {13494#false} is VALID [2022-02-20 19:59:29,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {13494#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {13494#false} is VALID [2022-02-20 19:59:29,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {13494#false} assume !false; {13494#false} is VALID [2022-02-20 19:59:29,975 INFO L272 TraceCheckUtils]: 47: Hoare triple {13494#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13493#true} is VALID [2022-02-20 19:59:29,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {13493#true} havoc ~__retres1~2; {13493#true} is VALID [2022-02-20 19:59:29,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {13493#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13493#true} is VALID [2022-02-20 19:59:29,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {13493#true} #res := ~__retres1~2; {13493#true} is VALID [2022-02-20 19:59:29,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {13493#true} assume true; {13493#true} is VALID [2022-02-20 19:59:29,975 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13493#true} {13494#false} #1557#return; {13494#false} is VALID [2022-02-20 19:59:29,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {13494#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {13494#false} is VALID [2022-02-20 19:59:29,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {13494#false} assume 0 != eval1_~tmp___1~0#1; {13494#false} is VALID [2022-02-20 19:59:29,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {13494#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {13494#false} is VALID [2022-02-20 19:59:29,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {13494#false} assume !(0 != eval1_~tmp~2#1); {13494#false} is VALID [2022-02-20 19:59:29,976 INFO L272 TraceCheckUtils]: 57: Hoare triple {13494#false} call error1(); {13494#false} is VALID [2022-02-20 19:59:29,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {13494#false} assume !false; {13494#false} is VALID [2022-02-20 19:59:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:29,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:29,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64324191] [2022-02-20 19:59:29,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64324191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:29,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:29,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:29,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732615161] [2022-02-20 19:59:29,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:29,978 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-02-20 19:59:29,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:29,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 19:59:30,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:30,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:30,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:30,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:30,015 INFO L87 Difference]: Start difference. First operand 611 states and 889 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-02-20 19:59:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:33,200 INFO L93 Difference]: Finished difference Result 1005 states and 1402 transitions. [2022-02-20 19:59:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:33,200 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-02-20 19:59:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 946 transitions. [2022-02-20 19:59:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 19:59:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 946 transitions. [2022-02-20 19:59:33,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 946 transitions. [2022-02-20 19:59:33,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 946 edges. 946 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:33,923 INFO L225 Difference]: With dead ends: 1005 [2022-02-20 19:59:33,923 INFO L226 Difference]: Without dead ends: 719 [2022-02-20 19:59:33,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:33,925 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 1194 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:33,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1221 Valid, 2062 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:59:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-02-20 19:59:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 623. [2022-02-20 19:59:33,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:33,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand has 623 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 533 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:59:33,954 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand has 623 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 533 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:59:33,955 INFO L87 Difference]: Start difference. First operand 719 states. Second operand has 623 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 533 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:59:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:33,976 INFO L93 Difference]: Finished difference Result 719 states and 1021 transitions. [2022-02-20 19:59:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1021 transitions. [2022-02-20 19:59:33,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:33,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:33,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 623 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 533 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) Second operand 719 states. [2022-02-20 19:59:33,981 INFO L87 Difference]: Start difference. First operand has 623 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 533 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) Second operand 719 states. [2022-02-20 19:59:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:34,001 INFO L93 Difference]: Finished difference Result 719 states and 1021 transitions. [2022-02-20 19:59:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1021 transitions. [2022-02-20 19:59:34,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:34,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:34,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:34,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 533 states have internal predecessors, (765), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:59:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 899 transitions. [2022-02-20 19:59:34,025 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 899 transitions. Word has length 59 [2022-02-20 19:59:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:34,025 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 899 transitions. [2022-02-20 19:59:34,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 899 transitions. [2022-02-20 19:59:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:34,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:34,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:34,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:34,026 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash 317205297, now seen corresponding path program 1 times [2022-02-20 19:59:34,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:34,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046642909] [2022-02-20 19:59:34,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:34,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:34,094 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:34,094 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:34,095 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:34,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:34,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:34,102 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 19:59:34,104 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:34,185 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:34,185 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:59:34,189 INFO L158 Benchmark]: Toolchain (without parser) took 22075.49ms. Allocated memory was 113.2MB in the beginning and 406.8MB in the end (delta: 293.6MB). Free memory was 84.6MB in the beginning and 352.9MB in the end (delta: -268.3MB). Peak memory consumption was 202.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:34,189 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:34,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.22ms. Allocated memory is still 113.2MB. Free memory was 84.4MB in the beginning and 72.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:34,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.18ms. Allocated memory is still 113.2MB. Free memory was 72.8MB in the beginning and 67.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:34,190 INFO L158 Benchmark]: Boogie Preprocessor took 63.91ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 63.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:34,190 INFO L158 Benchmark]: RCFGBuilder took 1027.81ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 63.3MB in the beginning and 82.6MB in the end (delta: -19.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:34,191 INFO L158 Benchmark]: TraceAbstraction took 20396.23ms. Allocated memory was 153.1MB in the beginning and 406.8MB in the end (delta: 253.8MB). Free memory was 81.9MB in the beginning and 352.9MB in the end (delta: -270.9MB). Peak memory consumption was 162.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:34,192 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.22ms. Allocated memory is still 113.2MB. Free memory was 84.4MB in the beginning and 72.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.18ms. Allocated memory is still 113.2MB. Free memory was 72.8MB in the beginning and 67.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.91ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 63.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1027.81ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 63.3MB in the beginning and 82.6MB in the end (delta: -19.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20396.23ms. Allocated memory was 153.1MB in the beginning and 406.8MB in the end (delta: 253.8MB). Free memory was 81.9MB in the beginning and 352.9MB in the end (delta: -270.9MB). Peak memory consumption was 162.1MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:34,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 b624ae719a4082a36ede7e321957dcadc62ef7cb91507fddf336d6b301c1668d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:35,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:36,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:36,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:36,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:36,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:36,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:36,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:36,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:36,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:36,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:36,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:36,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:36,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:36,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:36,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:36,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:36,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:36,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:36,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:36,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:36,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:36,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:36,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:36,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:36,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:36,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:36,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:36,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:36,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:36,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:36,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:36,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:36,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:36,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:36,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:36,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:36,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:36,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:36,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:36,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:36,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:59:36,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:36,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:36,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:36,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:36,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:36,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:36,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:36,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:36,122 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:36,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:36,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:36,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:36,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:36,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:36,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:36,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:36,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:36,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:36,124 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:36,124 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:36,125 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:36,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:36,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:36,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:36,125 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> b624ae719a4082a36ede7e321957dcadc62ef7cb91507fddf336d6b301c1668d [2022-02-20 19:59:36,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:36,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:36,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:36,422 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:36,422 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:36,423 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.09.cil-1.c [2022-02-20 19:59:36,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2845792c8/49ff29e36e4e409281ce98105eb2a3f2/FLAG4e1f7894f [2022-02-20 19:59:36,968 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:36,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.09.cil-1.c [2022-02-20 19:59:36,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2845792c8/49ff29e36e4e409281ce98105eb2a3f2/FLAG4e1f7894f [2022-02-20 19:59:37,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2845792c8/49ff29e36e4e409281ce98105eb2a3f2 [2022-02-20 19:59:37,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:37,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:37,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:37,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:37,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:37,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f70a8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37, skipping insertion in model container [2022-02-20 19:59:37,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:37,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:37,191 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.09.cil-1.c[914,927] [2022-02-20 19:59:37,309 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.09.cil-1.c[7125,7138] [2022-02-20 19:59:37,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:37,507 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:37,515 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.09.cil-1.c[914,927] [2022-02-20 19:59:37,544 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.09.cil-1.c[7125,7138] [2022-02-20 19:59:37,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:37,604 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:37,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37 WrapperNode [2022-02-20 19:59:37,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:37,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:37,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:37,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:37,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,695 INFO L137 Inliner]: procedures = 72, calls = 85, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 834 [2022-02-20 19:59:37,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:37,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:37,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:37,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:37,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:37,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:37,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:37,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:37,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (1/1) ... [2022-02-20 19:59:37,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:37,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:37,788 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-02-20 19:59:37,851 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-02-20 19:59:37,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:37,861 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:37,861 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:37,861 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:37,862 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:37,862 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:37,862 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:37,862 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:37,862 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:37,862 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:37,862 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:37,863 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:37,863 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:37,863 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:37,863 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:37,863 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:37,863 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:37,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:37,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:37,864 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:37,864 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:37,864 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:37,864 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:37,864 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:37,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:37,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:37,865 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:37,996 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:37,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:38,566 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:38,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:38,574 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 19:59:38,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:38 BoogieIcfgContainer [2022-02-20 19:59:38,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:38,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:38,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:38,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:38,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:37" (1/3) ... [2022-02-20 19:59:38,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b1bcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:38, skipping insertion in model container [2022-02-20 19:59:38,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:37" (2/3) ... [2022-02-20 19:59:38,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b1bcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:38, skipping insertion in model container [2022-02-20 19:59:38,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:38" (3/3) ... [2022-02-20 19:59:38,580 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.09.cil-1.c [2022-02-20 19:59:38,583 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:38,583 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:38,612 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:38,616 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:38,616 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 409 states, 354 states have (on average 1.6271186440677967) internal successors, (576), 361 states have internal predecessors, (576), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-02-20 19:59:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:38,641 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:38,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:38,642 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1585753871, now seen corresponding path program 1 times [2022-02-20 19:59:38,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:38,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786987121] [2022-02-20 19:59:38,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:38,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:38,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:38,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:38,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 19:59:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:38,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {412#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {412#true} is VALID [2022-02-20 19:59:38,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1; {412#true} is VALID [2022-02-20 19:59:38,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} assume 0bv32 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {423#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:38,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {423#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {423#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {430#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {430#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {430#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {430#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,002 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {430#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {423#(= (_ bv2 32) ~q_read_ev~0)} #1549#return; {423#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {423#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {423#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {423#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {423#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,004 INFO L272 TraceCheckUtils]: 12: Hoare triple {423#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {430#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:39,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {458#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:39,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {458#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:39,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {458#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:39,005 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {458#(= |old(~q_read_ev~0)| (_ bv0 32))} {423#(= (_ bv2 32) ~q_read_ev~0)} #1551#return; {413#false} is VALID [2022-02-20 19:59:39,006 INFO L272 TraceCheckUtils]: 17: Hoare triple {413#false} call activate_threads1(); {413#false} is VALID [2022-02-20 19:59:39,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {413#false} havoc ~tmp~1;havoc ~tmp___0~1; {413#false} is VALID [2022-02-20 19:59:39,006 INFO L272 TraceCheckUtils]: 19: Hoare triple {413#false} call #t~ret8 := is_do_write_p_triggered(); {413#false} is VALID [2022-02-20 19:59:39,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {413#false} havoc ~__retres1~0; {413#false} is VALID [2022-02-20 19:59:39,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {413#false} assume !(1bv32 == ~p_dw_pc~0); {413#false} is VALID [2022-02-20 19:59:39,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {413#false} ~__retres1~0 := 0bv32; {413#false} is VALID [2022-02-20 19:59:39,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {413#false} #res := ~__retres1~0; {413#false} is VALID [2022-02-20 19:59:39,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {413#false} assume true; {413#false} is VALID [2022-02-20 19:59:39,007 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {413#false} {413#false} #1545#return; {413#false} is VALID [2022-02-20 19:59:39,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {413#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {413#false} is VALID [2022-02-20 19:59:39,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {413#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {413#false} is VALID [2022-02-20 19:59:39,008 INFO L272 TraceCheckUtils]: 28: Hoare triple {413#false} call #t~ret9 := is_do_read_c_triggered(); {413#false} is VALID [2022-02-20 19:59:39,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {413#false} havoc ~__retres1~1; {413#false} is VALID [2022-02-20 19:59:39,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {413#false} assume !(1bv32 == ~c_dr_pc~0); {413#false} is VALID [2022-02-20 19:59:39,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {413#false} ~__retres1~1 := 0bv32; {413#false} is VALID [2022-02-20 19:59:39,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {413#false} #res := ~__retres1~1; {413#false} is VALID [2022-02-20 19:59:39,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {413#false} assume true; {413#false} is VALID [2022-02-20 19:59:39,009 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {413#false} {413#false} #1547#return; {413#false} is VALID [2022-02-20 19:59:39,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {413#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {413#false} is VALID [2022-02-20 19:59:39,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {413#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {413#false} is VALID [2022-02-20 19:59:39,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {413#false} assume true; {413#false} is VALID [2022-02-20 19:59:39,010 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {413#false} {413#false} #1553#return; {413#false} is VALID [2022-02-20 19:59:39,010 INFO L272 TraceCheckUtils]: 39: Hoare triple {413#false} call reset_delta_events1(); {413#false} is VALID [2022-02-20 19:59:39,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {413#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {413#false} is VALID [2022-02-20 19:59:39,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {413#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {413#false} is VALID [2022-02-20 19:59:39,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {413#false} assume true; {413#false} is VALID [2022-02-20 19:59:39,011 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {413#false} {413#false} #1555#return; {413#false} is VALID [2022-02-20 19:59:39,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-02-20 19:59:39,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {413#false} start_simulation1_~kernel_st~0#1 := 1bv32;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {413#false} is VALID [2022-02-20 19:59:39,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-02-20 19:59:39,011 INFO L272 TraceCheckUtils]: 47: Hoare triple {413#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {413#false} is VALID [2022-02-20 19:59:39,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {413#false} havoc ~__retres1~2; {413#false} is VALID [2022-02-20 19:59:39,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {413#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {413#false} is VALID [2022-02-20 19:59:39,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {413#false} #res := ~__retres1~2; {413#false} is VALID [2022-02-20 19:59:39,012 INFO L290 TraceCheckUtils]: 51: Hoare triple {413#false} assume true; {413#false} is VALID [2022-02-20 19:59:39,012 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {413#false} {413#false} #1557#return; {413#false} is VALID [2022-02-20 19:59:39,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {413#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {413#false} is VALID [2022-02-20 19:59:39,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {413#false} assume 0bv32 != eval1_~tmp___1~0#1; {413#false} is VALID [2022-02-20 19:59:39,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {413#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {413#false} is VALID [2022-02-20 19:59:39,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {413#false} assume !(0bv32 != eval1_~tmp~2#1); {413#false} is VALID [2022-02-20 19:59:39,013 INFO L272 TraceCheckUtils]: 57: Hoare triple {413#false} call error1(); {413#false} is VALID [2022-02-20 19:59:39,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-02-20 19:59:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:39,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:39,015 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:39,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786987121] [2022-02-20 19:59:39,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786987121] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:39,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:39,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:39,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249239196] [2022-02-20 19:59:39,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:39,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:39,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:39,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:39,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:39,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:39,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:39,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:39,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:39,085 INFO L87 Difference]: Start difference. First operand has 409 states, 354 states have (on average 1.6271186440677967) internal successors, (576), 361 states have internal predecessors, (576), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:41,390 INFO L93 Difference]: Finished difference Result 897 states and 1424 transitions. [2022-02-20 19:59:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2022-02-20 19:59:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2022-02-20 19:59:41,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1424 transitions. [2022-02-20 19:59:42,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1424 edges. 1424 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:42,444 INFO L225 Difference]: With dead ends: 897 [2022-02-20 19:59:42,444 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 19:59:42,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:42,453 INFO L933 BasicCegarLoop]: 616 mSDtfsCounter, 418 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:42,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 1551 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 19:59:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 495. [2022-02-20 19:59:42,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:42,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:59:42,522 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:59:42,525 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:59:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:42,562 INFO L93 Difference]: Finished difference Result 503 states and 746 transitions. [2022-02-20 19:59:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 746 transitions. [2022-02-20 19:59:42,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:42,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:42,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 503 states. [2022-02-20 19:59:42,572 INFO L87 Difference]: Start difference. First operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 503 states. [2022-02-20 19:59:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:42,608 INFO L93 Difference]: Finished difference Result 503 states and 746 transitions. [2022-02-20 19:59:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 746 transitions. [2022-02-20 19:59:42,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:42,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:42,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:42,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 422 states have (on average 1.509478672985782) internal successors, (637), 429 states have internal predecessors, (637), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:59:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 737 transitions. [2022-02-20 19:59:42,647 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 737 transitions. Word has length 59 [2022-02-20 19:59:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:42,647 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 737 transitions. [2022-02-20 19:59:42,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 737 transitions. [2022-02-20 19:59:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:42,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:42,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:42,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:42,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:42,860 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:42,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1346424911, now seen corresponding path program 1 times [2022-02-20 19:59:42,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:42,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124163351] [2022-02-20 19:59:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:42,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:42,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:42,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 19:59:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:43,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {3452#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {3452#true} is VALID [2022-02-20 19:59:43,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {3452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1; {3452#true} is VALID [2022-02-20 19:59:43,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {3452#true} assume 0bv32 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {3463#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {3463#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {3463#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {3463#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,113 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {3463#(= (_ bv2 32) ~q_write_ev~0)} #1549#return; {3463#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {3463#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {3463#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {3463#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {3463#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {3463#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {3463#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {3463#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {3463#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,115 INFO L272 TraceCheckUtils]: 12: Hoare triple {3463#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:43,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {3470#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {3501#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:43,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {3501#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {3501#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:43,116 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3501#(= |old(~q_write_ev~0)| (_ bv0 32))} {3463#(= (_ bv2 32) ~q_write_ev~0)} #1551#return; {3453#false} is VALID [2022-02-20 19:59:43,116 INFO L272 TraceCheckUtils]: 17: Hoare triple {3453#false} call activate_threads1(); {3453#false} is VALID [2022-02-20 19:59:43,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {3453#false} havoc ~tmp~1;havoc ~tmp___0~1; {3453#false} is VALID [2022-02-20 19:59:43,117 INFO L272 TraceCheckUtils]: 19: Hoare triple {3453#false} call #t~ret8 := is_do_write_p_triggered(); {3453#false} is VALID [2022-02-20 19:59:43,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {3453#false} havoc ~__retres1~0; {3453#false} is VALID [2022-02-20 19:59:43,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {3453#false} assume !(1bv32 == ~p_dw_pc~0); {3453#false} is VALID [2022-02-20 19:59:43,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {3453#false} ~__retres1~0 := 0bv32; {3453#false} is VALID [2022-02-20 19:59:43,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {3453#false} #res := ~__retres1~0; {3453#false} is VALID [2022-02-20 19:59:43,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {3453#false} assume true; {3453#false} is VALID [2022-02-20 19:59:43,117 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3453#false} {3453#false} #1545#return; {3453#false} is VALID [2022-02-20 19:59:43,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {3453#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {3453#false} is VALID [2022-02-20 19:59:43,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {3453#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {3453#false} is VALID [2022-02-20 19:59:43,118 INFO L272 TraceCheckUtils]: 28: Hoare triple {3453#false} call #t~ret9 := is_do_read_c_triggered(); {3453#false} is VALID [2022-02-20 19:59:43,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {3453#false} havoc ~__retres1~1; {3453#false} is VALID [2022-02-20 19:59:43,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {3453#false} assume !(1bv32 == ~c_dr_pc~0); {3453#false} is VALID [2022-02-20 19:59:43,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {3453#false} ~__retres1~1 := 0bv32; {3453#false} is VALID [2022-02-20 19:59:43,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {3453#false} #res := ~__retres1~1; {3453#false} is VALID [2022-02-20 19:59:43,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {3453#false} assume true; {3453#false} is VALID [2022-02-20 19:59:43,119 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3453#false} {3453#false} #1547#return; {3453#false} is VALID [2022-02-20 19:59:43,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {3453#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {3453#false} is VALID [2022-02-20 19:59:43,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {3453#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {3453#false} is VALID [2022-02-20 19:59:43,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {3453#false} assume true; {3453#false} is VALID [2022-02-20 19:59:43,119 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3453#false} {3453#false} #1553#return; {3453#false} is VALID [2022-02-20 19:59:43,120 INFO L272 TraceCheckUtils]: 39: Hoare triple {3453#false} call reset_delta_events1(); {3453#false} is VALID [2022-02-20 19:59:43,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {3453#false} assume !(1bv32 == ~q_read_ev~0); {3453#false} is VALID [2022-02-20 19:59:43,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {3453#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {3453#false} is VALID [2022-02-20 19:59:43,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {3453#false} assume true; {3453#false} is VALID [2022-02-20 19:59:43,120 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3453#false} {3453#false} #1555#return; {3453#false} is VALID [2022-02-20 19:59:43,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {3453#false} assume !false; {3453#false} is VALID [2022-02-20 19:59:43,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {3453#false} start_simulation1_~kernel_st~0#1 := 1bv32;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {3453#false} is VALID [2022-02-20 19:59:43,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {3453#false} assume !false; {3453#false} is VALID [2022-02-20 19:59:43,121 INFO L272 TraceCheckUtils]: 47: Hoare triple {3453#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3453#false} is VALID [2022-02-20 19:59:43,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {3453#false} havoc ~__retres1~2; {3453#false} is VALID [2022-02-20 19:59:43,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {3453#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {3453#false} is VALID [2022-02-20 19:59:43,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {3453#false} #res := ~__retres1~2; {3453#false} is VALID [2022-02-20 19:59:43,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {3453#false} assume true; {3453#false} is VALID [2022-02-20 19:59:43,122 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3453#false} {3453#false} #1557#return; {3453#false} is VALID [2022-02-20 19:59:43,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {3453#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3453#false} is VALID [2022-02-20 19:59:43,122 INFO L290 TraceCheckUtils]: 54: Hoare triple {3453#false} assume 0bv32 != eval1_~tmp___1~0#1; {3453#false} is VALID [2022-02-20 19:59:43,122 INFO L290 TraceCheckUtils]: 55: Hoare triple {3453#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3453#false} is VALID [2022-02-20 19:59:43,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {3453#false} assume !(0bv32 != eval1_~tmp~2#1); {3453#false} is VALID [2022-02-20 19:59:43,122 INFO L272 TraceCheckUtils]: 57: Hoare triple {3453#false} call error1(); {3453#false} is VALID [2022-02-20 19:59:43,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {3453#false} assume !false; {3453#false} is VALID [2022-02-20 19:59:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:43,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:43,123 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:43,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124163351] [2022-02-20 19:59:43,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124163351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:43,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:43,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:43,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312122924] [2022-02-20 19:59:43,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:43,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:43,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:43,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:43,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:43,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:43,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:43,170 INFO L87 Difference]: Start difference. First operand 495 states and 737 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,112 INFO L93 Difference]: Finished difference Result 889 states and 1293 transitions. [2022-02-20 19:59:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:45,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2022-02-20 19:59:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2022-02-20 19:59:45,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 874 transitions. [2022-02-20 19:59:45,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 874 edges. 874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:45,657 INFO L225 Difference]: With dead ends: 889 [2022-02-20 19:59:45,660 INFO L226 Difference]: Without dead ends: 709 [2022-02-20 19:59:45,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:45,662 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 405 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:45,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 1524 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2022-02-20 19:59:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 700. [2022-02-20 19:59:45,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:45,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 709 states. Second operand has 700 states, 583 states have (on average 1.463121783876501) internal successors, (853), 598 states have internal predecessors, (853), 71 states have call successors, (71), 35 states have call predecessors, (71), 44 states have return successors, (93), 71 states have call predecessors, (93), 68 states have call successors, (93) [2022-02-20 19:59:45,694 INFO L74 IsIncluded]: Start isIncluded. First operand 709 states. Second operand has 700 states, 583 states have (on average 1.463121783876501) internal successors, (853), 598 states have internal predecessors, (853), 71 states have call successors, (71), 35 states have call predecessors, (71), 44 states have return successors, (93), 71 states have call predecessors, (93), 68 states have call successors, (93) [2022-02-20 19:59:45,696 INFO L87 Difference]: Start difference. First operand 709 states. Second operand has 700 states, 583 states have (on average 1.463121783876501) internal successors, (853), 598 states have internal predecessors, (853), 71 states have call successors, (71), 35 states have call predecessors, (71), 44 states have return successors, (93), 71 states have call predecessors, (93), 68 states have call successors, (93) [2022-02-20 19:59:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,716 INFO L93 Difference]: Finished difference Result 709 states and 1027 transitions. [2022-02-20 19:59:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1027 transitions. [2022-02-20 19:59:45,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 700 states, 583 states have (on average 1.463121783876501) internal successors, (853), 598 states have internal predecessors, (853), 71 states have call successors, (71), 35 states have call predecessors, (71), 44 states have return successors, (93), 71 states have call predecessors, (93), 68 states have call successors, (93) Second operand 709 states. [2022-02-20 19:59:45,720 INFO L87 Difference]: Start difference. First operand has 700 states, 583 states have (on average 1.463121783876501) internal successors, (853), 598 states have internal predecessors, (853), 71 states have call successors, (71), 35 states have call predecessors, (71), 44 states have return successors, (93), 71 states have call predecessors, (93), 68 states have call successors, (93) Second operand 709 states. [2022-02-20 19:59:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,745 INFO L93 Difference]: Finished difference Result 709 states and 1027 transitions. [2022-02-20 19:59:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1027 transitions. [2022-02-20 19:59:45,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:45,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 583 states have (on average 1.463121783876501) internal successors, (853), 598 states have internal predecessors, (853), 71 states have call successors, (71), 35 states have call predecessors, (71), 44 states have return successors, (93), 71 states have call predecessors, (93), 68 states have call successors, (93) [2022-02-20 19:59:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1017 transitions. [2022-02-20 19:59:45,774 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1017 transitions. Word has length 59 [2022-02-20 19:59:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:45,775 INFO L470 AbstractCegarLoop]: Abstraction has 700 states and 1017 transitions. [2022-02-20 19:59:45,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1017 transitions. [2022-02-20 19:59:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:45,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:45,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:45,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 19:59:45,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:45,987 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1847884017, now seen corresponding path program 1 times [2022-02-20 19:59:45,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:45,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119301417] [2022-02-20 19:59:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:45,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:45,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:45,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:45,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 19:59:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:46,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {7185#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {7185#true} is VALID [2022-02-20 19:59:46,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {7185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1; {7185#true} is VALID [2022-02-20 19:59:46,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {7185#true} assume 0bv32 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {7185#true} is VALID [2022-02-20 19:59:46,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {7185#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {7185#true} call update_channels1(); {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {7185#true} assume !(1bv32 == ~q_req_up~0); {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7185#true} {7185#true} #1549#return; {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {7185#true} assume { :begin_inline_init_threads1 } true; {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {7185#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {7185#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {7185#true} assume { :end_inline_init_threads1 } true; {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L272 TraceCheckUtils]: 12: Hoare triple {7185#true} call fire_delta_events1(); {7185#true} is VALID [2022-02-20 19:59:46,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {7185#true} assume !(0bv32 == ~q_read_ev~0); {7185#true} is VALID [2022-02-20 19:59:46,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {7185#true} assume !(0bv32 == ~q_write_ev~0); {7185#true} is VALID [2022-02-20 19:59:46,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-02-20 19:59:46,227 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7185#true} {7185#true} #1551#return; {7185#true} is VALID [2022-02-20 19:59:46,227 INFO L272 TraceCheckUtils]: 17: Hoare triple {7185#true} call activate_threads1(); {7185#true} is VALID [2022-02-20 19:59:46,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {7185#true} havoc ~tmp~1;havoc ~tmp___0~1; {7185#true} is VALID [2022-02-20 19:59:46,227 INFO L272 TraceCheckUtils]: 19: Hoare triple {7185#true} call #t~ret8 := is_do_write_p_triggered(); {7185#true} is VALID [2022-02-20 19:59:46,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {7185#true} havoc ~__retres1~0; {7185#true} is VALID [2022-02-20 19:59:46,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {7185#true} assume !(1bv32 == ~p_dw_pc~0); {7185#true} is VALID [2022-02-20 19:59:46,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {7185#true} ~__retres1~0 := 0bv32; {7256#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:46,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {7256#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {7260#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:46,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {7260#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {7260#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:46,233 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7260#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {7185#true} #1545#return; {7267#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {7267#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {7271#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:46,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {7271#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L272 TraceCheckUtils]: 28: Hoare triple {7186#false} call #t~ret9 := is_do_read_c_triggered(); {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {7186#false} havoc ~__retres1~1; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {7186#false} assume !(1bv32 == ~c_dr_pc~0); {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {7186#false} ~__retres1~1 := 0bv32; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {7186#false} #res := ~__retres1~1; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {7186#false} assume true; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7186#false} {7186#false} #1547#return; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {7186#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {7186#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {7186#false} assume true; {7186#false} is VALID [2022-02-20 19:59:46,234 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7186#false} {7185#true} #1553#return; {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L272 TraceCheckUtils]: 39: Hoare triple {7186#false} call reset_delta_events1(); {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {7186#false} assume !(1bv32 == ~q_read_ev~0); {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {7186#false} assume !(1bv32 == ~q_write_ev~0); {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {7186#false} assume true; {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7186#false} {7186#false} #1555#return; {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {7186#false} start_simulation1_~kernel_st~0#1 := 1bv32;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L272 TraceCheckUtils]: 47: Hoare triple {7186#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7186#false} is VALID [2022-02-20 19:59:46,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {7186#false} havoc ~__retres1~2; {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {7186#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {7186#false} #res := ~__retres1~2; {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {7186#false} assume true; {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7186#false} {7186#false} #1557#return; {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {7186#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {7186#false} assume 0bv32 != eval1_~tmp___1~0#1; {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {7186#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {7186#false} assume !(0bv32 != eval1_~tmp~2#1); {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L272 TraceCheckUtils]: 57: Hoare triple {7186#false} call error1(); {7186#false} is VALID [2022-02-20 19:59:46,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-02-20 19:59:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:46,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:46,237 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:46,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119301417] [2022-02-20 19:59:46,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119301417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:46,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:46,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:46,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337257619] [2022-02-20 19:59:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:46,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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-02-20 19:59:46,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:46,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:46,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:46,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:46,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:46,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:46,274 INFO L87 Difference]: Start difference. First operand 700 states and 1017 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:47,611 INFO L93 Difference]: Finished difference Result 1091 states and 1550 transitions. [2022-02-20 19:59:47,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:47,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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-02-20 19:59:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2022-02-20 19:59:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2022-02-20 19:59:47,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 739 transitions. [2022-02-20 19:59:48,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 739 edges. 739 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:48,105 INFO L225 Difference]: With dead ends: 1091 [2022-02-20 19:59:48,105 INFO L226 Difference]: Without dead ends: 720 [2022-02-20 19:59:48,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:48,108 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 7 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:48,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 3009 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-02-20 19:59:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 710. [2022-02-20 19:59:48,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:48,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 720 states. Second operand has 710 states, 591 states have (on average 1.4534686971235196) internal successors, (859), 606 states have internal predecessors, (859), 71 states have call successors, (71), 35 states have call predecessors, (71), 46 states have return successors, (95), 73 states have call predecessors, (95), 68 states have call successors, (95) [2022-02-20 19:59:48,129 INFO L74 IsIncluded]: Start isIncluded. First operand 720 states. Second operand has 710 states, 591 states have (on average 1.4534686971235196) internal successors, (859), 606 states have internal predecessors, (859), 71 states have call successors, (71), 35 states have call predecessors, (71), 46 states have return successors, (95), 73 states have call predecessors, (95), 68 states have call successors, (95) [2022-02-20 19:59:48,130 INFO L87 Difference]: Start difference. First operand 720 states. Second operand has 710 states, 591 states have (on average 1.4534686971235196) internal successors, (859), 606 states have internal predecessors, (859), 71 states have call successors, (71), 35 states have call predecessors, (71), 46 states have return successors, (95), 73 states have call predecessors, (95), 68 states have call successors, (95) [2022-02-20 19:59:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:48,148 INFO L93 Difference]: Finished difference Result 720 states and 1041 transitions. [2022-02-20 19:59:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1041 transitions. [2022-02-20 19:59:48,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:48,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:48,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 710 states, 591 states have (on average 1.4534686971235196) internal successors, (859), 606 states have internal predecessors, (859), 71 states have call successors, (71), 35 states have call predecessors, (71), 46 states have return successors, (95), 73 states have call predecessors, (95), 68 states have call successors, (95) Second operand 720 states. [2022-02-20 19:59:48,152 INFO L87 Difference]: Start difference. First operand has 710 states, 591 states have (on average 1.4534686971235196) internal successors, (859), 606 states have internal predecessors, (859), 71 states have call successors, (71), 35 states have call predecessors, (71), 46 states have return successors, (95), 73 states have call predecessors, (95), 68 states have call successors, (95) Second operand 720 states. [2022-02-20 19:59:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:48,171 INFO L93 Difference]: Finished difference Result 720 states and 1041 transitions. [2022-02-20 19:59:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1041 transitions. [2022-02-20 19:59:48,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:48,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:48,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:48,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 591 states have (on average 1.4534686971235196) internal successors, (859), 606 states have internal predecessors, (859), 71 states have call successors, (71), 35 states have call predecessors, (71), 46 states have return successors, (95), 73 states have call predecessors, (95), 68 states have call successors, (95) [2022-02-20 19:59:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1025 transitions. [2022-02-20 19:59:48,197 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1025 transitions. Word has length 59 [2022-02-20 19:59:48,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:48,197 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 1025 transitions. [2022-02-20 19:59:48,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1025 transitions. [2022-02-20 19:59:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:48,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:48,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:48,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:48,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:48,409 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2122643631, now seen corresponding path program 1 times [2022-02-20 19:59:48,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:48,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58606742] [2022-02-20 19:59:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:48,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:48,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:48,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:48,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 19:59:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:48,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {11219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {11219#true} is VALID [2022-02-20 19:59:48,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {11219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1; {11219#true} is VALID [2022-02-20 19:59:48,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {11219#true} assume 0bv32 != main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {11219#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {11219#true} call update_channels1(); {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {11219#true} assume !(1bv32 == ~q_req_up~0); {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {11219#true} assume true; {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11219#true} {11219#true} #1549#return; {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {11219#true} assume { :begin_inline_init_threads1 } true; {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {11219#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {11219#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {11219#true} is VALID [2022-02-20 19:59:48,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {11219#true} assume { :end_inline_init_threads1 } true; {11219#true} is VALID [2022-02-20 19:59:48,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {11219#true} call fire_delta_events1(); {11219#true} is VALID [2022-02-20 19:59:48,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {11219#true} assume !(0bv32 == ~q_read_ev~0); {11219#true} is VALID [2022-02-20 19:59:48,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {11219#true} assume !(0bv32 == ~q_write_ev~0); {11219#true} is VALID [2022-02-20 19:59:48,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {11219#true} assume true; {11219#true} is VALID [2022-02-20 19:59:48,627 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11219#true} {11219#true} #1551#return; {11219#true} is VALID [2022-02-20 19:59:48,628 INFO L272 TraceCheckUtils]: 17: Hoare triple {11219#true} call activate_threads1(); {11219#true} is VALID [2022-02-20 19:59:48,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {11219#true} havoc ~tmp~1;havoc ~tmp___0~1; {11219#true} is VALID [2022-02-20 19:59:48,628 INFO L272 TraceCheckUtils]: 19: Hoare triple {11219#true} call #t~ret8 := is_do_write_p_triggered(); {11219#true} is VALID [2022-02-20 19:59:48,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {11219#true} havoc ~__retres1~0; {11219#true} is VALID [2022-02-20 19:59:48,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {11219#true} assume !(1bv32 == ~p_dw_pc~0); {11219#true} is VALID [2022-02-20 19:59:48,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {11219#true} ~__retres1~0 := 0bv32; {11219#true} is VALID [2022-02-20 19:59:48,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {11219#true} #res := ~__retres1~0; {11219#true} is VALID [2022-02-20 19:59:48,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {11219#true} assume true; {11219#true} is VALID [2022-02-20 19:59:48,629 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11219#true} {11219#true} #1545#return; {11219#true} is VALID [2022-02-20 19:59:48,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {11219#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {11219#true} is VALID [2022-02-20 19:59:48,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {11219#true} assume !(0bv32 != ~tmp~1); {11219#true} is VALID [2022-02-20 19:59:48,629 INFO L272 TraceCheckUtils]: 28: Hoare triple {11219#true} call #t~ret9 := is_do_read_c_triggered(); {11219#true} is VALID [2022-02-20 19:59:48,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {11219#true} havoc ~__retres1~1; {11219#true} is VALID [2022-02-20 19:59:48,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {11219#true} assume !(1bv32 == ~c_dr_pc~0); {11219#true} is VALID [2022-02-20 19:59:48,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {11219#true} ~__retres1~1 := 0bv32; {11317#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:48,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {11317#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {11321#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:48,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {11321#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {11321#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:48,631 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11321#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {11219#true} #1547#return; {11328#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:48,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {11328#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {11332#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:48,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {11332#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {11220#false} is VALID [2022-02-20 19:59:48,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {11220#false} assume true; {11220#false} is VALID [2022-02-20 19:59:48,632 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11220#false} {11219#true} #1553#return; {11220#false} is VALID [2022-02-20 19:59:48,632 INFO L272 TraceCheckUtils]: 39: Hoare triple {11220#false} call reset_delta_events1(); {11220#false} is VALID [2022-02-20 19:59:48,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {11220#false} assume !(1bv32 == ~q_read_ev~0); {11220#false} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {11220#false} assume !(1bv32 == ~q_write_ev~0); {11220#false} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {11220#false} assume true; {11220#false} is VALID [2022-02-20 19:59:48,633 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11220#false} {11220#false} #1555#return; {11220#false} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {11220#false} assume !false; {11220#false} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {11220#false} start_simulation1_~kernel_st~0#1 := 1bv32;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {11220#false} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {11220#false} assume !false; {11220#false} is VALID [2022-02-20 19:59:48,633 INFO L272 TraceCheckUtils]: 47: Hoare triple {11220#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11220#false} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {11220#false} havoc ~__retres1~2; {11220#false} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {11220#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {11220#false} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {11220#false} #res := ~__retres1~2; {11220#false} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {11220#false} assume true; {11220#false} is VALID [2022-02-20 19:59:48,634 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11220#false} {11220#false} #1557#return; {11220#false} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {11220#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {11220#false} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {11220#false} assume 0bv32 != eval1_~tmp___1~0#1; {11220#false} is VALID [2022-02-20 19:59:48,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {11220#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {11220#false} is VALID [2022-02-20 19:59:48,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {11220#false} assume !(0bv32 != eval1_~tmp~2#1); {11220#false} is VALID [2022-02-20 19:59:48,635 INFO L272 TraceCheckUtils]: 57: Hoare triple {11220#false} call error1(); {11220#false} is VALID [2022-02-20 19:59:48,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {11220#false} assume !false; {11220#false} is VALID [2022-02-20 19:59:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:48,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:48,636 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:48,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58606742] [2022-02-20 19:59:48,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58606742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:48,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:48,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:48,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176300657] [2022-02-20 19:59:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:48,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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-02-20 19:59:48,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:48,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:48,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:48,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:48,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:48,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:48,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:48,672 INFO L87 Difference]: Start difference. First operand 710 states and 1025 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,992 INFO L93 Difference]: Finished difference Result 1105 states and 1556 transitions. [2022-02-20 19:59:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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-02-20 19:59:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2022-02-20 19:59:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2022-02-20 19:59:50,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 734 transitions. [2022-02-20 19:59:50,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 734 edges. 734 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:50,542 INFO L225 Difference]: With dead ends: 1105 [2022-02-20 19:59:50,543 INFO L226 Difference]: Without dead ends: 724 [2022-02-20 19:59:50,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:50,544 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 4 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:50,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3005 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-02-20 19:59:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 720. [2022-02-20 19:59:50,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:50,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 724 states. Second operand has 720 states, 599 states have (on average 1.4440734557595993) internal successors, (865), 614 states have internal predecessors, (865), 71 states have call successors, (71), 35 states have call predecessors, (71), 48 states have return successors, (97), 75 states have call predecessors, (97), 68 states have call successors, (97) [2022-02-20 19:59:50,559 INFO L74 IsIncluded]: Start isIncluded. First operand 724 states. Second operand has 720 states, 599 states have (on average 1.4440734557595993) internal successors, (865), 614 states have internal predecessors, (865), 71 states have call successors, (71), 35 states have call predecessors, (71), 48 states have return successors, (97), 75 states have call predecessors, (97), 68 states have call successors, (97) [2022-02-20 19:59:50,560 INFO L87 Difference]: Start difference. First operand 724 states. Second operand has 720 states, 599 states have (on average 1.4440734557595993) internal successors, (865), 614 states have internal predecessors, (865), 71 states have call successors, (71), 35 states have call predecessors, (71), 48 states have return successors, (97), 75 states have call predecessors, (97), 68 states have call successors, (97) [2022-02-20 19:59:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,578 INFO L93 Difference]: Finished difference Result 724 states and 1039 transitions. [2022-02-20 19:59:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2022-02-20 19:59:50,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:50,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:50,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 720 states, 599 states have (on average 1.4440734557595993) internal successors, (865), 614 states have internal predecessors, (865), 71 states have call successors, (71), 35 states have call predecessors, (71), 48 states have return successors, (97), 75 states have call predecessors, (97), 68 states have call successors, (97) Second operand 724 states. [2022-02-20 19:59:50,582 INFO L87 Difference]: Start difference. First operand has 720 states, 599 states have (on average 1.4440734557595993) internal successors, (865), 614 states have internal predecessors, (865), 71 states have call successors, (71), 35 states have call predecessors, (71), 48 states have return successors, (97), 75 states have call predecessors, (97), 68 states have call successors, (97) Second operand 724 states. [2022-02-20 19:59:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,600 INFO L93 Difference]: Finished difference Result 724 states and 1039 transitions. [2022-02-20 19:59:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2022-02-20 19:59:50,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:50,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:50,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:50,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 599 states have (on average 1.4440734557595993) internal successors, (865), 614 states have internal predecessors, (865), 71 states have call successors, (71), 35 states have call predecessors, (71), 48 states have return successors, (97), 75 states have call predecessors, (97), 68 states have call successors, (97) [2022-02-20 19:59:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1033 transitions. [2022-02-20 19:59:50,627 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1033 transitions. Word has length 59 [2022-02-20 19:59:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:50,628 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1033 transitions. [2022-02-20 19:59:50,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1033 transitions. [2022-02-20 19:59:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:50,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:50,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:50,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:50,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:50,838 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash 317205297, now seen corresponding path program 1 times [2022-02-20 19:59:50,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:50,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026861729] [2022-02-20 19:59:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:50,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:50,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:50,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:50,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 19:59:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:50,923 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:51,088 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:51,088 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:51,089 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:51,090 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:51,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:51,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:51,305 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 19:59:51,308 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:51,369 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:51,370 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:59:51,373 INFO L158 Benchmark]: Toolchain (without parser) took 14365.12ms. Allocated memory was 67.1MB in the beginning and 182.5MB in the end (delta: 115.3MB). Free memory was 46.3MB in the beginning and 122.6MB in the end (delta: -76.2MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,374 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 67.1MB. Free memory was 48.7MB in the beginning and 48.7MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:51,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.53ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 35.3MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.23ms. Allocated memory is still 67.1MB. Free memory was 35.3MB in the beginning and 30.4MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,379 INFO L158 Benchmark]: Boogie Preprocessor took 66.51ms. Allocated memory is still 67.1MB. Free memory was 30.4MB in the beginning and 25.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,380 INFO L158 Benchmark]: RCFGBuilder took 813.05ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 25.6MB in the beginning and 63.0MB in the end (delta: -37.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,380 INFO L158 Benchmark]: TraceAbstraction took 12795.60ms. Allocated memory was 96.5MB in the beginning and 182.5MB in the end (delta: 86.0MB). Free memory was 63.0MB in the beginning and 122.6MB in the end (delta: -59.5MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,382 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 67.1MB. Free memory was 48.7MB in the beginning and 48.7MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 594.53ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 35.3MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.23ms. Allocated memory is still 67.1MB. Free memory was 35.3MB in the beginning and 30.4MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.51ms. Allocated memory is still 67.1MB. Free memory was 30.4MB in the beginning and 25.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 813.05ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 25.6MB in the beginning and 63.0MB in the end (delta: -37.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12795.60ms. Allocated memory was 96.5MB in the beginning and 182.5MB in the end (delta: 86.0MB). Free memory was 63.0MB in the beginning and 122.6MB in the end (delta: -59.5MB). Peak memory consumption was 27.1MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:51,422 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 Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator