./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:21:22,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:21:22,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:21:22,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:21:22,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:21:22,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:21:22,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:21:22,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:21:22,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:21:22,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:21:22,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:21:22,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:21:22,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:21:22,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:21:22,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:21:22,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:21:22,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:21:22,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:21:22,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:21:22,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:21:22,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:21:22,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:21:22,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:21:22,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:21:22,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:21:22,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:21:22,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:21:22,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:21:22,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:21:22,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:21:22,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:21:22,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:21:22,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:21:22,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:21:22,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:21:22,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:21:22,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:21:22,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:21:22,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:21:22,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:21:22,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:21:22,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:21:22,427 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:21:22,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:21:22,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:21:22,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:21:22,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:21:22,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:21:22,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:21:22,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:21:22,429 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:21:22,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:21:22,430 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:21:22,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:21:22,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:21:22,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:21:22,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:21:22,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:21:22,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:21:22,431 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:21:22,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:21:22,431 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:21:22,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:21:22,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:21:22,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:21:22,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:21:22,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:21:22,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:21:22,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:21:22,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:21:22,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:21:22,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:21:22,433 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:21:22,433 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:21:22,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:21:22,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:21:22,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/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_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f [2021-12-06 17:21:22,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:21:22,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:21:22,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:21:22,625 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:21:22,626 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:21:22,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2021-12-06 17:21:22,673 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/data/312be5099/10fb25b2c84c49ce83bcf27063070534/FLAG81387f848 [2021-12-06 17:21:23,052 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:21:23,053 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2021-12-06 17:21:23,063 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/data/312be5099/10fb25b2c84c49ce83bcf27063070534/FLAG81387f848 [2021-12-06 17:21:23,444 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/data/312be5099/10fb25b2c84c49ce83bcf27063070534 [2021-12-06 17:21:23,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:21:23,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:21:23,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:21:23,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:21:23,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:21:23,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4bfc96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23, skipping insertion in model container [2021-12-06 17:21:23,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:21:23,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:21:23,596 WARN L230 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_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c[914,927] [2021-12-06 17:21:23,628 WARN L230 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_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c[7125,7138] [2021-12-06 17:21:23,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:21:23,663 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:21:23,671 WARN L230 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_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c[914,927] [2021-12-06 17:21:23,685 WARN L230 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_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c[7125,7138] [2021-12-06 17:21:23,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:21:23,719 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:21:23,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23 WrapperNode [2021-12-06 17:21:23,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:21:23,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:21:23,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:21:23,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:21:23,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,763 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 519 [2021-12-06 17:21:23,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:21:23,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:21:23,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:21:23,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:21:23,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:21:23,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:21:23,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:21:23,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:21:23,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (1/1) ... [2021-12-06 17:21:23,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:21:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:23,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:21:23,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:21:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:21:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 17:21:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 17:21:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 17:21:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 17:21:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 17:21:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 17:21:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 17:21:23,849 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 17:21:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-06 17:21:23,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-06 17:21:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 17:21:23,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 17:21:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 17:21:23,849 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 17:21:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-06 17:21:23,849 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-06 17:21:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 17:21:23,849 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 17:21:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-06 17:21:23,850 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-06 17:21:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 17:21:23,850 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 17:21:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:21:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 17:21:23,850 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 17:21:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-06 17:21:23,850 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-06 17:21:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:21:23,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:21:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 17:21:23,850 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 17:21:23,925 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:21:23,927 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:21:24,304 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:21:24,314 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:21:24,314 INFO L301 CfgBuilder]: Removed 10 assume(true) statements. [2021-12-06 17:21:24,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:24 BoogieIcfgContainer [2021-12-06 17:21:24,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:21:24,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:21:24,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:21:24,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:21:24,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:21:23" (1/3) ... [2021-12-06 17:21:24,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741f478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:21:24, skipping insertion in model container [2021-12-06 17:21:24,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:23" (2/3) ... [2021-12-06 17:21:24,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741f478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:21:24, skipping insertion in model container [2021-12-06 17:21:24,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:24" (3/3) ... [2021-12-06 17:21:24,325 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2021-12-06 17:21:24,330 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:21:24,331 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 17:21:24,380 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:21:24,387 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:21:24,387 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 17:21:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-06 17:21:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:21:24,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:24,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:24,417 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:24,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:24,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1774585736, now seen corresponding path program 1 times [2021-12-06 17:21:24,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:24,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120133619] [2021-12-06 17:21:24,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:24,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:21:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:21:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:21:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:24,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:21:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:21:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:21:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:21:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:21:24,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:24,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120133619] [2021-12-06 17:21:24,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120133619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:24,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:24,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:21:24,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459941938] [2021-12-06 17:21:24,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:24,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:21:24,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:24,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:21:24,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:21:24,692 INFO L87 Difference]: Start difference. First operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:25,275 INFO L93 Difference]: Finished difference Result 635 states and 966 transitions. [2021-12-06 17:21:25,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:21:25,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-06 17:21:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:25,292 INFO L225 Difference]: With dead ends: 635 [2021-12-06 17:21:25,292 INFO L226 Difference]: Without dead ends: 385 [2021-12-06 17:21:25,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:21:25,300 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 657 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:25,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 1099 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:21:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-12-06 17:21:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 345. [2021-12-06 17:21:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2021-12-06 17:21:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 491 transitions. [2021-12-06 17:21:25,382 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 491 transitions. Word has length 59 [2021-12-06 17:21:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:25,382 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 491 transitions. [2021-12-06 17:21:25,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 491 transitions. [2021-12-06 17:21:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:21:25,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:25,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:25,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:21:25,387 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1011936105, now seen corresponding path program 1 times [2021-12-06 17:21:25,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:25,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44227741] [2021-12-06 17:21:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:25,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:21:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:21:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:25,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:21:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:21:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:25,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:21:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:25,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:21:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:21:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:21:25,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:25,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44227741] [2021-12-06 17:21:25,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44227741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:25,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:25,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:21:25,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028854069] [2021-12-06 17:21:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:25,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:21:25,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:25,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:21:25,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:21:25,517 INFO L87 Difference]: Start difference. First operand 345 states and 491 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:26,054 INFO L93 Difference]: Finished difference Result 694 states and 970 transitions. [2021-12-06 17:21:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:21:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-06 17:21:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:26,059 INFO L225 Difference]: With dead ends: 694 [2021-12-06 17:21:26,059 INFO L226 Difference]: Without dead ends: 516 [2021-12-06 17:21:26,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:21:26,061 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 722 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:26,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 1534 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:21:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-12-06 17:21:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 441. [2021-12-06 17:21:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2021-12-06 17:21:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 625 transitions. [2021-12-06 17:21:26,098 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 625 transitions. Word has length 59 [2021-12-06 17:21:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:26,098 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 625 transitions. [2021-12-06 17:21:26,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 625 transitions. [2021-12-06 17:21:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:21:26,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:26,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:26,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:21:26,102 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:26,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:26,102 INFO L85 PathProgramCache]: Analyzing trace with hash -118449767, now seen corresponding path program 1 times [2021-12-06 17:21:26,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:26,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034228084] [2021-12-06 17:21:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:26,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:21:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:21:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:21:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:21:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:21:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:21:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:21:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:21:26,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:26,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034228084] [2021-12-06 17:21:26,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034228084] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:26,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:26,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:21:26,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613453263] [2021-12-06 17:21:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:26,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:21:26,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:21:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:21:26,216 INFO L87 Difference]: Start difference. First operand 441 states and 625 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:26,617 INFO L93 Difference]: Finished difference Result 743 states and 1040 transitions. [2021-12-06 17:21:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:21:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-06 17:21:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:26,621 INFO L225 Difference]: With dead ends: 743 [2021-12-06 17:21:26,621 INFO L226 Difference]: Without dead ends: 475 [2021-12-06 17:21:26,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:21:26,623 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 428 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:26,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 1543 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:21:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-12-06 17:21:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 446. [2021-12-06 17:21:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2021-12-06 17:21:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 628 transitions. [2021-12-06 17:21:26,650 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 628 transitions. Word has length 59 [2021-12-06 17:21:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:26,650 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 628 transitions. [2021-12-06 17:21:26,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 628 transitions. [2021-12-06 17:21:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:21:26,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:26,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:26,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:21:26,652 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 156309847, now seen corresponding path program 1 times [2021-12-06 17:21:26,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:26,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709844502] [2021-12-06 17:21:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:26,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:21:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:21:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:21:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:21:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:21:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:21:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:21:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:21:26,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:26,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709844502] [2021-12-06 17:21:26,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709844502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:26,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:26,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:21:26,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515733934] [2021-12-06 17:21:26,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:26,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:21:26,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:21:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:21:26,759 INFO L87 Difference]: Start difference. First operand 446 states and 628 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:27,191 INFO L93 Difference]: Finished difference Result 765 states and 1062 transitions. [2021-12-06 17:21:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:21:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-06 17:21:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:27,194 INFO L225 Difference]: With dead ends: 765 [2021-12-06 17:21:27,194 INFO L226 Difference]: Without dead ends: 492 [2021-12-06 17:21:27,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:21:27,196 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 290 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:27,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 1694 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:21:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-12-06 17:21:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 461. [2021-12-06 17:21:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2021-12-06 17:21:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 643 transitions. [2021-12-06 17:21:27,219 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 643 transitions. Word has length 59 [2021-12-06 17:21:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:27,219 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 643 transitions. [2021-12-06 17:21:27,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 643 transitions. [2021-12-06 17:21:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:21:27,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:27,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:27,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:21:27,221 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1649128487, now seen corresponding path program 1 times [2021-12-06 17:21:27,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:27,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58388156] [2021-12-06 17:21:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:27,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 17:21:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:27,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 17:21:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 17:21:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 17:21:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:27,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 17:21:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 17:21:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:27,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 17:21:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:21:27,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:27,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58388156] [2021-12-06 17:21:27,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58388156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:27,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:27,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:21:27,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432944353] [2021-12-06 17:21:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:27,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:21:27,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:21:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:21:27,300 INFO L87 Difference]: Start difference. First operand 461 states and 643 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:27,795 INFO L93 Difference]: Finished difference Result 855 states and 1156 transitions. [2021-12-06 17:21:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:21:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-06 17:21:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:27,800 INFO L225 Difference]: With dead ends: 855 [2021-12-06 17:21:27,800 INFO L226 Difference]: Without dead ends: 569 [2021-12-06 17:21:27,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:21:27,802 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 714 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:27,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [735 Valid, 1297 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:21:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-12-06 17:21:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 473. [2021-12-06 17:21:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2021-12-06 17:21:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 653 transitions. [2021-12-06 17:21:27,825 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 653 transitions. Word has length 59 [2021-12-06 17:21:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:27,825 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 653 transitions. [2021-12-06 17:21:27,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 653 transitions. [2021-12-06 17:21:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:21:27,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:27,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:27,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:21:27,826 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:27,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 651694103, now seen corresponding path program 1 times [2021-12-06 17:21:27,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:27,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869898628] [2021-12-06 17:21:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:27,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:21:27,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:21:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:21:27,872 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:21:27,873 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:21:27,873 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 17:21:27,875 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 17:21:27,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 17:21:27,878 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-06 17:21:27,880 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:21:27,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:21:27 BoogieIcfgContainer [2021-12-06 17:21:27,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:21:27,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:21:27,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:21:27,947 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:21:27,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:24" (3/4) ... [2021-12-06 17:21:27,948 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 17:21:28,022 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 17:21:28,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:21:28,023 INFO L158 Benchmark]: Toolchain (without parser) took 4576.75ms. Allocated memory was 92.3MB in the beginning and 151.0MB in the end (delta: 58.7MB). Free memory was 56.8MB in the beginning and 114.9MB in the end (delta: -58.2MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2021-12-06 17:21:28,023 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:21:28,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.81ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 61.6MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 17:21:28,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.64ms. Allocated memory is still 92.3MB. Free memory was 61.6MB in the beginning and 58.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 17:21:28,024 INFO L158 Benchmark]: Boogie Preprocessor took 29.91ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 56.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:21:28,025 INFO L158 Benchmark]: RCFGBuilder took 522.65ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 56.0MB in the beginning and 92.1MB in the end (delta: -36.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2021-12-06 17:21:28,025 INFO L158 Benchmark]: TraceAbstraction took 3627.37ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 91.1MB in the beginning and 41.0MB in the end (delta: 50.1MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2021-12-06 17:21:28,026 INFO L158 Benchmark]: Witness Printer took 76.12ms. Allocated memory is still 151.0MB. Free memory was 41.0MB in the beginning and 114.9MB in the end (delta: -73.9MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2021-12-06 17:21:28,027 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.15ms. Allocated memory is still 92.3MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.81ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 61.6MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.64ms. Allocated memory is still 92.3MB. Free memory was 61.6MB in the beginning and 58.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.91ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 56.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.65ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 56.0MB in the beginning and 92.1MB in the end (delta: -36.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3627.37ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 91.1MB in the beginning and 41.0MB in the end (delta: 50.1MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. * Witness Printer took 76.12ms. Allocated memory is still 151.0MB. Free memory was 41.0MB in the beginning and 114.9MB in the end (delta: -73.9MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int m_st ; [L505] int t1_st ; [L506] int t2_st ; [L507] int t3_st ; [L508] int m_i ; [L509] int t1_i ; [L510] int t2_i ; [L511] int t3_i ; [L512] int M_E = 2; [L513] int T1_E = 2; [L514] int T2_E = 2; [L515] int T3_E = 2; [L516] int E_M = 2; [L517] int E_1 = 2; [L518] int E_2 = 2; [L519] int E_3 = 2; [L525] int token ; [L527] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L1212] COND TRUE __VERIFIER_nondet_int() [L1213] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 259 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2862 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2811 mSDsluCounter, 7167 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5305 mSDsCounter, 624 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3818 IncrementalHoareTripleChecker+Invalid, 4442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 624 mSolverCounterUnsat, 1862 mSDtfsCounter, 3818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=5, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 271 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 17:21:28,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75f5c14-490d-4a4d-8f21-8bb16f3a66e5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE