./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8 --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 fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:55:19,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:55:19,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:55:19,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:55:19,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:55:19,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:55:19,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:55:19,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:55:19,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:55:19,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:55:19,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:55:19,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:55:19,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:55:19,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:55:19,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:55:19,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:55:19,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:55:19,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:55:19,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:55:19,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:55:19,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:55:19,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:55:19,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:55:19,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:55:19,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:55:19,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:55:19,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:55:19,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:55:19,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:55:19,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:55:19,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:55:19,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:55:19,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:55:19,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:55:19,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:55:19,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:55:19,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:55:19,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:55:19,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:55:19,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:55:19,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:55:19,522 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:55:19,544 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:55:19,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:55:19,544 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:55:19,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:55:19,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:55:19,545 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:55:19,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:55:19,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:55:19,546 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:55:19,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:55:19,547 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:55:19,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:55:19,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:55:19,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:55:19,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:55:19,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:55:19,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:55:19,548 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:55:19,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:55:19,549 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:55:19,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:55:19,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:55:19,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:55:19,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:55:19,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:55:19,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:55:19,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:55:19,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:55:19,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:55:19,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:55:19,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:55:19,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:55:19,551 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:55:19,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:55:19,551 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:55:19,551 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8 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 -> fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e [2022-12-13 13:55:19,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:55:19,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:55:19,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:55:19,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:55:19,772 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:55:19,773 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-12-13 13:55:22,261 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:55:22,457 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:55:22,457 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-12-13 13:55:22,466 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/data/746528882/b1c4af4f43e74f03ac180fb57340034f/FLAGaa92b6e9b [2022-12-13 13:55:22,817 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/data/746528882/b1c4af4f43e74f03ac180fb57340034f [2022-12-13 13:55:22,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:55:22,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:55:22,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:55:22,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:55:22,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:55:22,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:55:22" (1/1) ... [2022-12-13 13:55:22,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93daf78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:22, skipping insertion in model container [2022-12-13 13:55:22,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:55:22" (1/1) ... [2022-12-13 13:55:22,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:55:22,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:55:22,954 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[914,927] [2022-12-13 13:55:22,995 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[7125,7138] [2022-12-13 13:55:23,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:55:23,049 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:55:23,057 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[914,927] [2022-12-13 13:55:23,069 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[7125,7138] [2022-12-13 13:55:23,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:55:23,111 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:55:23,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23 WrapperNode [2022-12-13 13:55:23,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:55:23,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:55:23,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:55:23,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:55:23,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,152 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 751 [2022-12-13 13:55:23,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:55:23,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:55:23,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:55:23,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:55:23,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,178 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:55:23,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:55:23,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:55:23,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:55:23,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (1/1) ... [2022-12-13 13:55:23,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:55:23,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:55:23,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:55:23,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:55:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:55:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 13:55:23,232 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 13:55:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 13:55:23,233 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 13:55:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 13:55:23,233 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 13:55:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 13:55:23,233 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 13:55:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-13 13:55:23,233 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-13 13:55:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 13:55:23,233 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 13:55:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 13:55:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 13:55:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-13 13:55:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-13 13:55:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 13:55:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 13:55:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-13 13:55:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-13 13:55:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 13:55:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 13:55:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:55:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 13:55:23,235 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 13:55:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-13 13:55:23,235 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-13 13:55:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:55:23,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:55:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 13:55:23,235 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 13:55:23,329 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:55:23,331 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:55:23,902 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:55:23,912 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:55:23,912 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-12-13 13:55:23,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:55:23 BoogieIcfgContainer [2022-12-13 13:55:23,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:55:23,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:55:23,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:55:23,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:55:23,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:55:22" (1/3) ... [2022-12-13 13:55:23,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f64f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:55:23, skipping insertion in model container [2022-12-13 13:55:23,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:55:23" (2/3) ... [2022-12-13 13:55:23,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f64f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:55:23, skipping insertion in model container [2022-12-13 13:55:23,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:55:23" (3/3) ... [2022-12-13 13:55:23,924 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-12-13 13:55:23,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:55:23,939 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:55:23,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:55:23,998 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23b2722c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:55:23,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 13:55:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-12-13 13:55:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:55:24,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:55:24,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:24,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:55:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1357445742, now seen corresponding path program 1 times [2022-12-13 13:55:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:24,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764807319] [2022-12-13 13:55:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:24,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:55:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:55:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:55:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:55:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:24,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:55:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:55:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:55:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:24,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764807319] [2022-12-13 13:55:24,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764807319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:24,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:24,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:55:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300114244] [2022-12-13 13:55:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:24,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:55:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:55:24,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:55:24,341 INFO L87 Difference]: Start difference. First operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:55:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:55:25,014 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2022-12-13 13:55:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:55:25,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-12-13 13:55:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:55:25,026 INFO L225 Difference]: With dead ends: 714 [2022-12-13 13:55:25,026 INFO L226 Difference]: Without dead ends: 367 [2022-12-13 13:55:25,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:55:25,032 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 775 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:55:25,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 983 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:55:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-12-13 13:55:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 349. [2022-12-13 13:55:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-12-13 13:55:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 522 transitions. [2022-12-13 13:55:25,089 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 522 transitions. Word has length 59 [2022-12-13 13:55:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:55:25,089 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 522 transitions. [2022-12-13 13:55:25,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:55:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 522 transitions. [2022-12-13 13:55:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:55:25,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:55:25,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:25,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:55:25,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:55:25,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash -876365484, now seen corresponding path program 1 times [2022-12-13 13:55:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:25,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138548290] [2022-12-13 13:55:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:55:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:25,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:55:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:55:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:25,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:55:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:25,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:55:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:25,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:55:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:25,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:55:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:25,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:25,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138548290] [2022-12-13 13:55:25,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138548290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:25,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:25,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:55:25,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26298022] [2022-12-13 13:55:25,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:25,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:55:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:55:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:55:25,273 INFO L87 Difference]: Start difference. First operand 349 states and 522 transitions. 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-12-13 13:55:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:55:26,066 INFO L93 Difference]: Finished difference Result 574 states and 838 transitions. [2022-12-13 13:55:26,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:55:26,066 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-12-13 13:55:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:55:26,069 INFO L225 Difference]: With dead ends: 574 [2022-12-13 13:55:26,070 INFO L226 Difference]: Without dead ends: 485 [2022-12-13 13:55:26,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:55:26,071 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 1151 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:55:26,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 1264 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 13:55:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-12-13 13:55:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 445. [2022-12-13 13:55:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-12-13 13:55:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 653 transitions. [2022-12-13 13:55:26,101 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 653 transitions. Word has length 59 [2022-12-13 13:55:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:55:26,101 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 653 transitions. [2022-12-13 13:55:26,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:55:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 653 transitions. [2022-12-13 13:55:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:55:26,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:55:26,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:26,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:55:26,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:55:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash -637036524, now seen corresponding path program 1 times [2022-12-13 13:55:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:26,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323950745] [2022-12-13 13:55:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:26,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:55:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:55:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:26,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:55:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:55:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:55:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:55:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:55:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323950745] [2022-12-13 13:55:26,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323950745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:26,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:26,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:55:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708024296] [2022-12-13 13:55:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:26,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:55:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:55:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:55:26,258 INFO L87 Difference]: Start difference. First operand 445 states and 653 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-12-13 13:55:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:55:27,254 INFO L93 Difference]: Finished difference Result 794 states and 1131 transitions. [2022-12-13 13:55:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:55:27,255 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-12-13 13:55:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:55:27,258 INFO L225 Difference]: With dead ends: 794 [2022-12-13 13:55:27,258 INFO L226 Difference]: Without dead ends: 616 [2022-12-13 13:55:27,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:55:27,259 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 1024 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:55:27,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1778 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 13:55:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-12-13 13:55:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 541. [2022-12-13 13:55:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-12-13 13:55:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 786 transitions. [2022-12-13 13:55:27,288 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 786 transitions. Word has length 59 [2022-12-13 13:55:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:55:27,288 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 786 transitions. [2022-12-13 13:55:27,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:55:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 786 transitions. [2022-12-13 13:55:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:55:27,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:55:27,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:27,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:55:27,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:55:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash 256449814, now seen corresponding path program 1 times [2022-12-13 13:55:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:27,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317396414] [2022-12-13 13:55:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:55:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:55:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:55:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:55:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:55:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:55:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:55:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:27,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:27,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317396414] [2022-12-13 13:55:27,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317396414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:27,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:27,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:55:27,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79701644] [2022-12-13 13:55:27,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:27,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:55:27,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:27,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:55:27,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:55:27,399 INFO L87 Difference]: Start difference. First operand 541 states and 786 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-12-13 13:55:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:55:28,108 INFO L93 Difference]: Finished difference Result 869 states and 1241 transitions. [2022-12-13 13:55:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:55:28,109 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-12-13 13:55:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:55:28,112 INFO L225 Difference]: With dead ends: 869 [2022-12-13 13:55:28,113 INFO L226 Difference]: Without dead ends: 601 [2022-12-13 13:55:28,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:55:28,114 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 456 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:55:28,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 2054 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 13:55:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-12-13 13:55:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 556. [2022-12-13 13:55:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-12-13 13:55:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 801 transitions. [2022-12-13 13:55:28,139 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 801 transitions. Word has length 59 [2022-12-13 13:55:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:55:28,139 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 801 transitions. [2022-12-13 13:55:28,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:55:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 801 transitions. [2022-12-13 13:55:28,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:55:28,141 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:55:28,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:28,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:55:28,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:55:28,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:28,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2061888148, now seen corresponding path program 1 times [2022-12-13 13:55:28,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:28,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79701664] [2022-12-13 13:55:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:55:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:55:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:55:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:55:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:55:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:55:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:55:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:28,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:28,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79701664] [2022-12-13 13:55:28,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79701664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:28,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:28,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:55:28,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957284900] [2022-12-13 13:55:28,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:28,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:55:28,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:28,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:55:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:55:28,273 INFO L87 Difference]: Start difference. First operand 556 states and 801 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-12-13 13:55:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:55:28,974 INFO L93 Difference]: Finished difference Result 875 states and 1234 transitions. [2022-12-13 13:55:28,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:55:28,975 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-12-13 13:55:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:55:28,978 INFO L225 Difference]: With dead ends: 875 [2022-12-13 13:55:28,978 INFO L226 Difference]: Without dead ends: 592 [2022-12-13 13:55:28,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:55:28,980 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 675 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:55:28,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1824 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 13:55:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-12-13 13:55:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 561. [2022-12-13 13:55:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-12-13 13:55:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 804 transitions. [2022-12-13 13:55:29,020 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 804 transitions. Word has length 59 [2022-12-13 13:55:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:55:29,021 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 804 transitions. [2022-12-13 13:55:29,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:55:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 804 transitions. [2022-12-13 13:55:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:55:29,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:55:29,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:29,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:55:29,023 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:55:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1958319534, now seen corresponding path program 1 times [2022-12-13 13:55:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:29,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522646721] [2022-12-13 13:55:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:55:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:55:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:55:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:29,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:55:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:55:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:55:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:55:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:29,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522646721] [2022-12-13 13:55:29,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522646721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:29,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:29,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 13:55:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868627603] [2022-12-13 13:55:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:29,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:55:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:55:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:55:29,162 INFO L87 Difference]: Start difference. First operand 561 states and 804 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 13:55:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:55:30,551 INFO L93 Difference]: Finished difference Result 1931 states and 2655 transitions. [2022-12-13 13:55:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:55:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-12-13 13:55:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:55:30,557 INFO L225 Difference]: With dead ends: 1931 [2022-12-13 13:55:30,557 INFO L226 Difference]: Without dead ends: 1625 [2022-12-13 13:55:30,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 13:55:30,559 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 2785 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2800 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:55:30,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2800 Valid, 2039 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [552 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 13:55:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2022-12-13 13:55:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1477. [2022-12-13 13:55:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-12-13 13:55:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1962 transitions. [2022-12-13 13:55:30,642 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1962 transitions. Word has length 59 [2022-12-13 13:55:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:55:30,643 INFO L495 AbstractCegarLoop]: Abstraction has 1477 states and 1962 transitions. [2022-12-13 13:55:30,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 13:55:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1962 transitions. [2022-12-13 13:55:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:55:30,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:55:30,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:30,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:55:30,644 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:55:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash -440465259, now seen corresponding path program 1 times [2022-12-13 13:55:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:30,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099534307] [2022-12-13 13:55:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:55:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:30,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:55:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:30,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:55:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:30,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:55:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:55:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:55:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:55:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:30,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099534307] [2022-12-13 13:55:30,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099534307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:30,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:30,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:55:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603757974] [2022-12-13 13:55:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:30,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:55:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:55:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:55:30,798 INFO L87 Difference]: Start difference. First operand 1477 states and 1962 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-12-13 13:55:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:55:31,647 INFO L93 Difference]: Finished difference Result 2758 states and 3550 transitions. [2022-12-13 13:55:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:55:31,648 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-12-13 13:55:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:55:31,652 INFO L225 Difference]: With dead ends: 2758 [2022-12-13 13:55:31,652 INFO L226 Difference]: Without dead ends: 1765 [2022-12-13 13:55:31,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-12-13 13:55:31,654 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 1278 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:55:31,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 1285 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 13:55:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-12-13 13:55:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1419. [2022-12-13 13:55:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-12-13 13:55:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1879 transitions. [2022-12-13 13:55:31,718 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1879 transitions. Word has length 59 [2022-12-13 13:55:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:55:31,718 INFO L495 AbstractCegarLoop]: Abstraction has 1419 states and 1879 transitions. [2022-12-13 13:55:31,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:55:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1879 transitions. [2022-12-13 13:55:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:55:31,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:55:31,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:31,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:55:31,720 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:55:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1860357331, now seen corresponding path program 1 times [2022-12-13 13:55:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:31,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433586247] [2022-12-13 13:55:31,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:55:31,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:55:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:55:31,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:55:31,774 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:55:31,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 13:55:31,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 13:55:31,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:55:31,780 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:31,783 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:55:31,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:55:31 BoogieIcfgContainer [2022-12-13 13:55:31,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:55:31,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:55:31,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:55:31,846 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:55:31,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:55:23" (3/4) ... [2022-12-13 13:55:31,848 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:55:31,898 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:55:31,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:55:31,899 INFO L158 Benchmark]: Toolchain (without parser) took 9079.24ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 113.2MB in the beginning and 167.7MB in the end (delta: -54.5MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-12-13 13:55:31,899 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:55:31,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.56ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 90.7MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 13:55:31,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.26ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 86.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:55:31,900 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 83.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:55:31,900 INFO L158 Benchmark]: RCFGBuilder took 731.60ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 93.9MB in the end (delta: -10.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2022-12-13 13:55:31,900 INFO L158 Benchmark]: TraceAbstraction took 7928.57ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 93.2MB in the beginning and 178.1MB in the end (delta: -85.0MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. [2022-12-13 13:55:31,900 INFO L158 Benchmark]: Witness Printer took 52.34ms. Allocated memory is still 226.5MB. Free memory was 178.1MB in the beginning and 167.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:55:31,901 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.56ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 90.7MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.26ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 86.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 83.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 731.60ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 93.9MB in the end (delta: -10.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7928.57ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 93.2MB in the beginning and 178.1MB in the end (delta: -85.0MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. * Witness Printer took 52.34ms. Allocated memory is still 226.5MB. Free memory was 178.1MB in the beginning and 167.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int t7_pc = 0; [L508] int m_st ; [L509] int t1_st ; [L510] int t2_st ; [L511] int t3_st ; [L512] int t4_st ; [L513] int t5_st ; [L514] int t6_st ; [L515] int t7_st ; [L516] int m_i ; [L517] int t1_i ; [L518] int t2_i ; [L519] int t3_i ; [L520] int t4_i ; [L521] int t5_i ; [L522] int t6_i ; [L523] int t7_i ; [L524] int M_E = 2; [L525] int T1_E = 2; [L526] int T2_E = 2; [L527] int T3_E = 2; [L528] int T4_E = 2; [L529] int T5_E = 2; [L530] int T6_E = 2; [L531] int T7_E = 2; [L532] int E_M = 2; [L533] int E_1 = 2; [L534] int E_2 = 2; [L535] int E_3 = 2; [L536] int E_4 = 2; [L537] int E_5 = 2; [L538] int E_6 = 2; [L539] int E_7 = 2; [L549] int token ; [L551] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L1712] COND TRUE __VERIFIER_nondet_int() [L1713] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 359 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8228 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8144 mSDsluCounter, 11227 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9006 mSDsCounter, 1407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8839 IncrementalHoareTripleChecker+Invalid, 10246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1407 mSolverCounterUnsat, 2221 mSDtfsCounter, 8839 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1477occurred in iteration=6, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 703 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 13:55:31,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1e38fd5-f0c3-4c52-a6c0-277ac3d0f1bb/bin/uautomizer-uyxdKDjOR8/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE