./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc --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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:04:28,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:04:28,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:04:28,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:04:28,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:04:28,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:04:28,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:04:28,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:04:28,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:04:28,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:04:28,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:04:28,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:04:28,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:04:28,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:04:28,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:04:28,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:04:28,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:04:28,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:04:28,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:04:28,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:04:28,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:04:28,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:04:28,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:04:28,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:04:28,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:04:28,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:04:28,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:04:28,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:04:28,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:04:28,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:04:28,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:04:28,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:04:28,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:04:28,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:04:28,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:04:28,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:04:28,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:04:28,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:04:28,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:04:28,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:04:28,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:04:28,561 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:04:28,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:04:28,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:04:28,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:04:28,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:04:28,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:04:28,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:04:28,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:04:28,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:04:28,614 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:04:28,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:04:28,615 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:04:28,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:04:28,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:04:28,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:04:28,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:04:28,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:04:28,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:04:28,625 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:04:28,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:04:28,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:04:28,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:04:28,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:04:28,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:04:28,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:04:28,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:04:28,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:04:28,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:04:28,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:04:28,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:04:28,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:04:28,631 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:04:28,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:04:28,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:04:28,632 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_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/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_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-02 20:04:28,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:04:28,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:04:28,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:04:28,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:04:29,000 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:04:29,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-02 20:04:29,078 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/data/ce2317ab6/6b0a03f44d454ab3a63032f204247c79/FLAGc97c243fd [2022-11-02 20:04:29,789 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:04:29,790 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-02 20:04:29,809 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/data/ce2317ab6/6b0a03f44d454ab3a63032f204247c79/FLAGc97c243fd [2022-11-02 20:04:30,034 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/data/ce2317ab6/6b0a03f44d454ab3a63032f204247c79 [2022-11-02 20:04:30,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:04:30,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:04:30,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:04:30,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:04:30,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:04:30,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:30,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7185df02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30, skipping insertion in model container [2022-11-02 20:04:30,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:30,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:04:30,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:04:30,702 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_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-02 20:04:30,709 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_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-02 20:04:30,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:04:30,725 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:04:30,787 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_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-02 20:04:30,790 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_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-02 20:04:30,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:04:30,875 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:04:30,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30 WrapperNode [2022-11-02 20:04:30,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:04:30,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:04:30,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:04:30,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:04:30,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:30,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:30,981 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-11-02 20:04:30,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:04:30,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:04:30,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:04:30,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:04:30,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:30,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:31,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:31,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:31,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:31,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:31,044 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:31,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:31,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:04:31,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:04:31,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:04:31,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:04:31,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (1/1) ... [2022-11-02 20:04:31,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:04:31,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:31,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:04:31,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:04:31,156 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-02 20:04:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-02 20:04:31,157 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-02 20:04:31,158 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-02 20:04:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:04:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:04:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:04:31,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:04:31,160 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:04:31,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:04:31,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:04:31,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:04:31,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:04:31,163 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:04:31,435 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:04:31,437 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:04:31,946 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:04:31,964 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:04:31,965 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:04:31,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:31 BoogieIcfgContainer [2022-11-02 20:04:31,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:04:31,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:04:31,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:04:31,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:04:31,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:04:30" (1/3) ... [2022-11-02 20:04:31,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c77461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:04:31, skipping insertion in model container [2022-11-02 20:04:31,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:30" (2/3) ... [2022-11-02 20:04:31,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c77461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:04:31, skipping insertion in model container [2022-11-02 20:04:31,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:31" (3/3) ... [2022-11-02 20:04:31,985 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-02 20:04:31,996 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:04:32,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:04:32,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:04:32,010 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:04:32,183 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:04:32,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-11-02 20:04:32,333 INFO L130 PetriNetUnfolder]: 13/229 cut-off events. [2022-11-02 20:04:32,334 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:04:32,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 372 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-11-02 20:04:32,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 231 transitions, 478 flow [2022-11-02 20:04:32,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 219 transitions, 447 flow [2022-11-02 20:04:32,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:04:32,368 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50245773, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:04:32,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 20:04:32,384 INFO L130 PetriNetUnfolder]: 1/64 cut-off events. [2022-11-02 20:04:32,384 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:04:32,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:32,385 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:04:32,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-11-02 20:04:32,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:32,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967172301] [2022-11-02 20:04:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:32,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:32,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967172301] [2022-11-02 20:04:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967172301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:32,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:32,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:04:32,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182661895] [2022-11-02 20:04:32,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:32,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:04:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:32,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:04:32,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:04:32,838 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 231 [2022-11-02 20:04:32,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 219 transitions, 447 flow. Second operand has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:32,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:32,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 231 [2022-11-02 20:04:32,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:04:32,990 INFO L130 PetriNetUnfolder]: 9/210 cut-off events. [2022-11-02 20:04:32,990 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:04:32,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 210 events. 9/210 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 272 event pairs, 0 based on Foata normal form. 5/205 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2022-11-02 20:04:33,000 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 3 selfloop transitions, 0 changer transitions 0/210 dead transitions. [2022-11-02 20:04:33,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 435 flow [2022-11-02 20:04:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:04:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:04:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2022-11-02 20:04:33,029 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9675324675324676 [2022-11-02 20:04:33,030 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2022-11-02 20:04:33,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2022-11-02 20:04:33,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:04:33,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2022-11-02 20:04:33,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.5) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:33,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:33,056 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:33,059 INFO L175 Difference]: Start difference. First operand has 213 places, 219 transitions, 447 flow. Second operand 2 states and 447 transitions. [2022-11-02 20:04:33,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 435 flow [2022-11-02 20:04:33,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:04:33,074 INFO L231 Difference]: Finished difference. Result has 206 places, 210 transitions, 424 flow [2022-11-02 20:04:33,077 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=206, PETRI_TRANSITIONS=210} [2022-11-02 20:04:33,084 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2022-11-02 20:04:33,085 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 210 transitions, 424 flow [2022-11-02 20:04:33,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:33,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:33,086 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:33,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:04:33,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-11-02 20:04:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:33,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058889843] [2022-11-02 20:04:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:34,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:34,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058889843] [2022-11-02 20:04:34,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058889843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:34,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:34,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:04:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132366232] [2022-11-02 20:04:34,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:34,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:04:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:04:34,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:04:34,600 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 231 [2022-11-02 20:04:34,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 210 transitions, 424 flow. Second operand has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:34,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:34,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 231 [2022-11-02 20:04:34,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:04:35,886 INFO L130 PetriNetUnfolder]: 611/2582 cut-off events. [2022-11-02 20:04:35,886 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-11-02 20:04:35,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 2582 events. 611/2582 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 20434 event pairs, 459 based on Foata normal form. 0/2410 useless extension candidates. Maximal degree in co-relation 3511. Up to 882 conditions per place. [2022-11-02 20:04:35,908 INFO L137 encePairwiseOnDemand]: 218/231 looper letters, 42 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2022-11-02 20:04:35,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 206 transitions, 524 flow [2022-11-02 20:04:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:04:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:04:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2213 transitions. [2022-11-02 20:04:35,916 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.736929736929737 [2022-11-02 20:04:35,916 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2213 transitions. [2022-11-02 20:04:35,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2213 transitions. [2022-11-02 20:04:35,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:04:35,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2213 transitions. [2022-11-02 20:04:35,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 170.23076923076923) internal successors, (2213), 13 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:35,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:35,934 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:35,934 INFO L175 Difference]: Start difference. First operand has 206 places, 210 transitions, 424 flow. Second operand 13 states and 2213 transitions. [2022-11-02 20:04:35,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 206 transitions, 524 flow [2022-11-02 20:04:35,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:04:35,944 INFO L231 Difference]: Finished difference. Result has 215 places, 206 transitions, 440 flow [2022-11-02 20:04:35,945 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=440, PETRI_PLACES=215, PETRI_TRANSITIONS=206} [2022-11-02 20:04:35,945 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2022-11-02 20:04:35,946 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 440 flow [2022-11-02 20:04:35,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:35,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:35,948 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:35,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:04:35,949 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:35,952 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-11-02 20:04:35,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:35,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046467336] [2022-11-02 20:04:35,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:36,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046467336] [2022-11-02 20:04:36,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046467336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:36,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:36,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181682583] [2022-11-02 20:04:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:36,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:36,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:36,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:36,256 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2022-11-02 20:04:36,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 206 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:36,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2022-11-02 20:04:36,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:04:36,377 INFO L130 PetriNetUnfolder]: 16/307 cut-off events. [2022-11-02 20:04:36,377 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:04:36,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 307 events. 16/307 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 688 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 346. Up to 12 conditions per place. [2022-11-02 20:04:36,379 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 7 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-11-02 20:04:36,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 473 flow [2022-11-02 20:04:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:04:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-11-02 20:04:36,383 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-11-02 20:04:36,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-11-02 20:04:36,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-11-02 20:04:36,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:04:36,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-11-02 20:04:36,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,390 INFO L175 Difference]: Start difference. First operand has 215 places, 206 transitions, 440 flow. Second operand 3 states and 655 transitions. [2022-11-02 20:04:36,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 473 flow [2022-11-02 20:04:36,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 450 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-02 20:04:36,396 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 419 flow [2022-11-02 20:04:36,396 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-11-02 20:04:36,399 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-11-02 20:04:36,399 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 419 flow [2022-11-02 20:04:36,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:36,400 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:36,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:04:36,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 464408434, now seen corresponding path program 1 times [2022-11-02 20:04:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:36,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007770674] [2022-11-02 20:04:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:36,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:36,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007770674] [2022-11-02 20:04:36,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007770674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:36,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:36,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89200376] [2022-11-02 20:04:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:36,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:36,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:36,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:36,552 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 231 [2022-11-02 20:04:36,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:36,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 231 [2022-11-02 20:04:36,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:04:36,629 INFO L130 PetriNetUnfolder]: 20/336 cut-off events. [2022-11-02 20:04:36,629 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:04:36,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 336 events. 20/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 671 event pairs, 6 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 401. Up to 24 conditions per place. [2022-11-02 20:04:36,632 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 13 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2022-11-02 20:04:36,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 208 transitions, 461 flow [2022-11-02 20:04:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:04:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-11-02 20:04:36,635 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-11-02 20:04:36,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-11-02 20:04:36,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-11-02 20:04:36,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:04:36,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-11-02 20:04:36,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,647 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 419 flow. Second operand 3 states and 655 transitions. [2022-11-02 20:04:36,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 208 transitions, 461 flow [2022-11-02 20:04:36,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:04:36,652 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 425 flow [2022-11-02 20:04:36,653 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-11-02 20:04:36,656 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-11-02 20:04:36,656 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 425 flow [2022-11-02 20:04:36,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:36,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:36,657 INFO L208 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:36,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:04:36,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:36,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1789731816, now seen corresponding path program 1 times [2022-11-02 20:04:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:36,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183754901] [2022-11-02 20:04:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:36,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:36,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183754901] [2022-11-02 20:04:36,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183754901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:04:36,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115938847] [2022-11-02 20:04:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:36,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:04:36,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:36,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:04:36,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:04:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:37,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:04:37,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:04:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:37,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:04:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:37,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115938847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:04:37,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:04:37,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-02 20:04:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587422076] [2022-11-02 20:04:37,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:04:37,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:04:37,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:37,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:04:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:37,447 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:04:37,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 425 flow. Second operand has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:37,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:37,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:04:37,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:04:37,629 INFO L130 PetriNetUnfolder]: 30/423 cut-off events. [2022-11-02 20:04:37,629 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:04:37,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 423 events. 30/423 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 684 event pairs, 4 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 537. Up to 19 conditions per place. [2022-11-02 20:04:37,632 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 20 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-11-02 20:04:37,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 533 flow [2022-11-02 20:04:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:04:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1939 transitions. [2022-11-02 20:04:37,638 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-11-02 20:04:37,638 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1939 transitions. [2022-11-02 20:04:37,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1939 transitions. [2022-11-02 20:04:37,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:04:37,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1939 transitions. [2022-11-02 20:04:37,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.44444444444446) internal successors, (1939), 9 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:37,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:37,649 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:37,650 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 425 flow. Second operand 9 states and 1939 transitions. [2022-11-02 20:04:37,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 533 flow [2022-11-02 20:04:37,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:04:37,656 INFO L231 Difference]: Finished difference. Result has 216 places, 209 transitions, 473 flow [2022-11-02 20:04:37,656 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=473, PETRI_PLACES=216, PETRI_TRANSITIONS=209} [2022-11-02 20:04:37,659 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 3 predicate places. [2022-11-02 20:04:37,659 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 473 flow [2022-11-02 20:04:37,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:37,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:37,663 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:37,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:04:37,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:04:37,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:37,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash -146638564, now seen corresponding path program 2 times [2022-11-02 20:04:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:37,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091342888] [2022-11-02 20:04:37,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:37,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-02 20:04:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:38,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091342888] [2022-11-02 20:04:38,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091342888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:38,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:38,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519969731] [2022-11-02 20:04:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:38,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:38,237 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2022-11-02 20:04:38,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:38,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:38,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2022-11-02 20:04:38,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:04:38,361 INFO L130 PetriNetUnfolder]: 25/611 cut-off events. [2022-11-02 20:04:38,361 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-02 20:04:38,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 611 events. 25/611 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1286 event pairs, 3 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 725. Up to 19 conditions per place. [2022-11-02 20:04:38,365 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 3 changer transitions 3/211 dead transitions. [2022-11-02 20:04:38,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 512 flow [2022-11-02 20:04:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:04:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2022-11-02 20:04:38,368 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2022-11-02 20:04:38,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2022-11-02 20:04:38,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2022-11-02 20:04:38,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:04:38,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2022-11-02 20:04:38,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:38,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:38,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:38,373 INFO L175 Difference]: Start difference. First operand has 216 places, 209 transitions, 473 flow. Second operand 3 states and 645 transitions. [2022-11-02 20:04:38,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 512 flow [2022-11-02 20:04:38,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 506 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-02 20:04:38,379 INFO L231 Difference]: Finished difference. Result has 217 places, 206 transitions, 467 flow [2022-11-02 20:04:38,380 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-11-02 20:04:38,381 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2022-11-02 20:04:38,381 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 467 flow [2022-11-02 20:04:38,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:38,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:38,382 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:38,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:04:38,383 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:38,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1143464642, now seen corresponding path program 1 times [2022-11-02 20:04:38,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:38,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095980192] [2022-11-02 20:04:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:38,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:38,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095980192] [2022-11-02 20:04:38,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095980192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:04:38,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868310710] [2022-11-02 20:04:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:38,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:04:38,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:38,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:04:38,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:04:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:38,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:04:39,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:04:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:39,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:04:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:39,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868310710] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:04:39,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:04:39,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-02 20:04:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792888038] [2022-11-02 20:04:39,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:04:39,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:04:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:04:39,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:04:39,544 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:04:39,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 467 flow. Second operand has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:39,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:39,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:04:39,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:04:39,977 INFO L130 PetriNetUnfolder]: 58/747 cut-off events. [2022-11-02 20:04:39,978 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-02 20:04:39,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 747 events. 58/747 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1390 event pairs, 4 based on Foata normal form. 8/736 useless extension candidates. Maximal degree in co-relation 1047. Up to 39 conditions per place. [2022-11-02 20:04:39,982 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 21 changer transitions 1/249 dead transitions. [2022-11-02 20:04:39,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 765 flow [2022-11-02 20:04:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:04:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:04:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4517 transitions. [2022-11-02 20:04:39,992 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9311482168625026 [2022-11-02 20:04:39,992 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4517 transitions. [2022-11-02 20:04:39,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4517 transitions. [2022-11-02 20:04:39,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:04:39,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4517 transitions. [2022-11-02 20:04:40,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 215.0952380952381) internal successors, (4517), 21 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:40,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:40,016 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:40,016 INFO L175 Difference]: Start difference. First operand has 217 places, 206 transitions, 467 flow. Second operand 21 states and 4517 transitions. [2022-11-02 20:04:40,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 765 flow [2022-11-02 20:04:40,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 249 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:04:40,023 INFO L231 Difference]: Finished difference. Result has 238 places, 218 transitions, 592 flow [2022-11-02 20:04:40,024 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=592, PETRI_PLACES=238, PETRI_TRANSITIONS=218} [2022-11-02 20:04:40,024 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 25 predicate places. [2022-11-02 20:04:40,025 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 218 transitions, 592 flow [2022-11-02 20:04:40,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:40,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:40,027 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:40,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:04:40,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 20:04:40,255 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1330324832, now seen corresponding path program 2 times [2022-11-02 20:04:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:40,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741150208] [2022-11-02 20:04:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:41,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:41,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741150208] [2022-11-02 20:04:41,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741150208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:04:41,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486671286] [2022-11-02 20:04:41,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:04:41,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:04:41,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:41,174 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:04:41,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:04:41,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:04:41,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:04:41,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:04:41,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:04:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:41,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:04:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:42,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486671286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:04:42,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:04:42,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-02 20:04:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613690666] [2022-11-02 20:04:42,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:04:42,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:04:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:04:42,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:04:42,594 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:04:42,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 218 transitions, 592 flow. Second operand has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:42,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:42,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:04:42,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:04:43,794 INFO L130 PetriNetUnfolder]: 114/1393 cut-off events. [2022-11-02 20:04:43,795 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-11-02 20:04:43,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1393 events. 114/1393 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2795 event pairs, 4 based on Foata normal form. 16/1374 useless extension candidates. Maximal degree in co-relation 2155. Up to 79 conditions per place. [2022-11-02 20:04:43,804 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 80 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2022-11-02 20:04:43,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 1330 flow [2022-11-02 20:04:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-02 20:04:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-02 20:04:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9673 transitions. [2022-11-02 20:04:43,824 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9305435305435306 [2022-11-02 20:04:43,824 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9673 transitions. [2022-11-02 20:04:43,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9673 transitions. [2022-11-02 20:04:43,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:04:43,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9673 transitions. [2022-11-02 20:04:43,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 214.95555555555555) internal successors, (9673), 45 states have internal predecessors, (9673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:43,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:43,872 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:43,872 INFO L175 Difference]: Start difference. First operand has 238 places, 218 transitions, 592 flow. Second operand 45 states and 9673 transitions. [2022-11-02 20:04:43,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 1330 flow [2022-11-02 20:04:43,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 312 transitions, 1290 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-02 20:04:43,890 INFO L231 Difference]: Finished difference. Result has 284 places, 243 transitions, 870 flow [2022-11-02 20:04:43,891 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=870, PETRI_PLACES=284, PETRI_TRANSITIONS=243} [2022-11-02 20:04:43,893 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 71 predicate places. [2022-11-02 20:04:43,894 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 243 transitions, 870 flow [2022-11-02 20:04:43,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:43,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:04:43,897 INFO L208 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:43,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:04:44,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:04:44,111 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:04:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 681727648, now seen corresponding path program 3 times [2022-11-02 20:04:44,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:44,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648948265] [2022-11-02 20:04:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:44,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:46,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648948265] [2022-11-02 20:04:46,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648948265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:04:46,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944267618] [2022-11-02 20:04:46,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:04:46,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:04:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:46,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:04:46,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:04:47,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:04:47,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:04:47,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 20:04:47,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:04:49,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:04:49,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:04:49,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:04:49,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:04:49,832 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:04:49,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-02 20:04:49,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:04:49,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:04:49,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:04:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-11-02 20:04:49,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:04:50,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2022-11-02 20:04:50,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:04:50,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:04:50,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:04:50,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 20:04:50,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:04:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-11-02 20:04:51,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944267618] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:04:51,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:04:51,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53 [2022-11-02 20:04:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154591047] [2022-11-02 20:04:51,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:04:51,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-02 20:04:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:51,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-02 20:04:51,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2291, Unknown=1, NotChecked=100, Total=2756 [2022-11-02 20:04:51,335 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 231 [2022-11-02 20:04:51,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 243 transitions, 870 flow. Second operand has 53 states, 53 states have (on average 168.9245283018868) internal successors, (8953), 53 states have internal predecessors, (8953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:51,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:04:51,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 231 [2022-11-02 20:04:51,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:05:06,002 INFO L130 PetriNetUnfolder]: 2125/7558 cut-off events. [2022-11-02 20:05:06,002 INFO L131 PetriNetUnfolder]: For 2826/2826 co-relation queries the response was YES. [2022-11-02 20:05:06,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15817 conditions, 7558 events. 2125/7558 cut-off events. For 2826/2826 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 40055 event pairs, 33 based on Foata normal form. 8/7466 useless extension candidates. Maximal degree in co-relation 15794. Up to 687 conditions per place. [2022-11-02 20:05:06,067 INFO L137 encePairwiseOnDemand]: 210/231 looper letters, 871 selfloop transitions, 372 changer transitions 0/1379 dead transitions. [2022-11-02 20:05:06,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1379 transitions, 6630 flow [2022-11-02 20:05:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-11-02 20:05:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2022-11-02 20:05:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 30418 transitions. [2022-11-02 20:05:06,109 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.727511898782617 [2022-11-02 20:05:06,109 INFO L72 ComplementDD]: Start complementDD. Operand 181 states and 30418 transitions. [2022-11-02 20:05:06,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 30418 transitions. [2022-11-02 20:05:06,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:05:06,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 181 states and 30418 transitions. [2022-11-02 20:05:06,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 182 states, 181 states have (on average 168.05524861878453) internal successors, (30418), 181 states have internal predecessors, (30418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:06,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 182 states, 182 states have (on average 231.0) internal successors, (42042), 182 states have internal predecessors, (42042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:06,251 INFO L81 ComplementDD]: Finished complementDD. Result has 182 states, 182 states have (on average 231.0) internal successors, (42042), 182 states have internal predecessors, (42042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:06,251 INFO L175 Difference]: Start difference. First operand has 284 places, 243 transitions, 870 flow. Second operand 181 states and 30418 transitions. [2022-11-02 20:05:06,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1379 transitions, 6630 flow [2022-11-02 20:05:06,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 1379 transitions, 6515 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-11-02 20:05:06,289 INFO L231 Difference]: Finished difference. Result has 515 places, 648 transitions, 3382 flow [2022-11-02 20:05:06,290 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=181, PETRI_FLOW=3382, PETRI_PLACES=515, PETRI_TRANSITIONS=648} [2022-11-02 20:05:06,291 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 302 predicate places. [2022-11-02 20:05:06,291 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 648 transitions, 3382 flow [2022-11-02 20:05:06,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 168.9245283018868) internal successors, (8953), 53 states have internal predecessors, (8953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:06,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:05:06,295 INFO L208 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:06,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:06,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:06,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:05:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1049680381, now seen corresponding path program 1 times [2022-11-02 20:05:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:06,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063783072] [2022-11-02 20:05:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063783072] [2022-11-02 20:05:09,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063783072] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:09,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937307576] [2022-11-02 20:05:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:09,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:09,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:09,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:05:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:09,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:05:09,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:10,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:12,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937307576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:12,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:12,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-11-02 20:05:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230074332] [2022-11-02 20:05:12,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:12,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-02 20:05:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:12,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-02 20:05:12,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2022-11-02 20:05:12,548 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:05:12,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 648 transitions, 3382 flow. Second operand has 70 states, 70 states have (on average 214.4857142857143) internal successors, (15014), 70 states have internal predecessors, (15014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:12,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:05:12,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:05:12,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:05:21,225 INFO L130 PetriNetUnfolder]: 927/8255 cut-off events. [2022-11-02 20:05:21,225 INFO L131 PetriNetUnfolder]: For 115974/115974 co-relation queries the response was YES. [2022-11-02 20:05:21,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26430 conditions, 8255 events. 927/8255 cut-off events. For 115974/115974 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 37354 event pairs, 7 based on Foata normal form. 102/8349 useless extension candidates. Maximal degree in co-relation 26337. Up to 590 conditions per place. [2022-11-02 20:05:21,327 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 170 selfloop transitions, 162 changer transitions 0/873 dead transitions. [2022-11-02 20:05:21,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 873 transitions, 5718 flow [2022-11-02 20:05:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-11-02 20:05:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-11-02 20:05:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 21274 transitions. [2022-11-02 20:05:21,353 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9302549302549302 [2022-11-02 20:05:21,354 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 21274 transitions. [2022-11-02 20:05:21,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 21274 transitions. [2022-11-02 20:05:21,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:05:21,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 21274 transitions. [2022-11-02 20:05:21,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 100 states, 99 states have (on average 214.88888888888889) internal successors, (21274), 99 states have internal predecessors, (21274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:21,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 100 states, 100 states have (on average 231.0) internal successors, (23100), 100 states have internal predecessors, (23100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:21,442 INFO L81 ComplementDD]: Finished complementDD. Result has 100 states, 100 states have (on average 231.0) internal successors, (23100), 100 states have internal predecessors, (23100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:21,442 INFO L175 Difference]: Start difference. First operand has 515 places, 648 transitions, 3382 flow. Second operand 99 states and 21274 transitions. [2022-11-02 20:05:21,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 873 transitions, 5718 flow [2022-11-02 20:05:21,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 873 transitions, 5538 flow, removed 4 selfloop flow, removed 45 redundant places. [2022-11-02 20:05:21,880 INFO L231 Difference]: Finished difference. Result has 586 places, 715 transitions, 4472 flow [2022-11-02 20:05:21,882 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3202, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=4472, PETRI_PLACES=586, PETRI_TRANSITIONS=715} [2022-11-02 20:05:21,884 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 373 predicate places. [2022-11-02 20:05:21,884 INFO L495 AbstractCegarLoop]: Abstraction has has 586 places, 715 transitions, 4472 flow [2022-11-02 20:05:21,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 214.4857142857143) internal successors, (15014), 70 states have internal predecessors, (15014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:21,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:05:21,888 INFO L208 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:21,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:22,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:05:22,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:05:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2115049742, now seen corresponding path program 2 times [2022-11-02 20:05:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:22,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129600540] [2022-11-02 20:05:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:34,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129600540] [2022-11-02 20:05:34,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129600540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:34,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198746865] [2022-11-02 20:05:34,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:05:34,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:34,830 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:34,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:05:35,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:05:35,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:05:35,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 20:05:35,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:37,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:44,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198746865] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:44,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:44,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2022-11-02 20:05:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654397413] [2022-11-02 20:05:44,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:44,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-11-02 20:05:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:44,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-11-02 20:05:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4830, Invalid=14076, Unknown=0, NotChecked=0, Total=18906 [2022-11-02 20:05:44,768 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:05:44,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 715 transitions, 4472 flow. Second operand has 138 states, 138 states have (on average 214.47826086956522) internal successors, (29598), 138 states have internal predecessors, (29598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:44,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:05:44,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:05:44,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:16,354 INFO L130 PetriNetUnfolder]: 1811/16517 cut-off events. [2022-11-02 20:06:16,354 INFO L131 PetriNetUnfolder]: For 328979/328979 co-relation queries the response was YES. [2022-11-02 20:06:16,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55498 conditions, 16517 events. 1811/16517 cut-off events. For 328979/328979 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 75769 event pairs, 7 based on Foata normal form. 204/16713 useless extension candidates. Maximal degree in co-relation 55388. Up to 1474 conditions per place. [2022-11-02 20:06:16,756 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 340 selfloop transitions, 298 changer transitions 0/1179 dead transitions. [2022-11-02 20:06:16,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1179 transitions, 9852 flow [2022-11-02 20:06:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-11-02 20:06:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-11-02 20:06:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 43187 transitions. [2022-11-02 20:06:16,807 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.930132885356766 [2022-11-02 20:06:16,807 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 43187 transitions. [2022-11-02 20:06:16,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 43187 transitions. [2022-11-02 20:06:16,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:16,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 43187 transitions. [2022-11-02 20:06:16,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 202 states, 201 states have (on average 214.86069651741295) internal successors, (43187), 201 states have internal predecessors, (43187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:16,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 202 states, 202 states have (on average 231.0) internal successors, (46662), 202 states have internal predecessors, (46662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:16,941 INFO L81 ComplementDD]: Finished complementDD. Result has 202 states, 202 states have (on average 231.0) internal successors, (46662), 202 states have internal predecessors, (46662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:16,941 INFO L175 Difference]: Start difference. First operand has 586 places, 715 transitions, 4472 flow. Second operand 201 states and 43187 transitions. [2022-11-02 20:06:16,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 1179 transitions, 9852 flow [2022-11-02 20:06:17,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 1179 transitions, 9242 flow, removed 208 selfloop flow, removed 48 redundant places. [2022-11-02 20:06:17,871 INFO L231 Difference]: Finished difference. Result has 773 places, 852 transitions, 6800 flow [2022-11-02 20:06:17,872 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=4134, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=6800, PETRI_PLACES=773, PETRI_TRANSITIONS=852} [2022-11-02 20:06:17,872 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 560 predicate places. [2022-11-02 20:06:17,872 INFO L495 AbstractCegarLoop]: Abstraction has has 773 places, 852 transitions, 6800 flow [2022-11-02 20:06:17,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 214.47826086956522) internal successors, (29598), 138 states have internal predecessors, (29598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:17,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:17,876 INFO L208 CegarLoopForPetriNet]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:06:17,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-02 20:06:18,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:06:18,077 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:06:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 160354627, now seen corresponding path program 3 times [2022-11-02 20:06:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:18,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557373851] [2022-11-02 20:06:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:06:59,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:59,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557373851] [2022-11-02 20:06:59,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557373851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:06:59,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385453876] [2022-11-02 20:06:59,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:06:59,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:06:59,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:06:59,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:06:59,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07e65c0-f69b-4c7e-b00f-eb9edcbc0b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:07:00,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 20:07:00,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:07:00,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-02 20:07:00,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:07:15,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:07:15,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:07:15,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:07:15,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:07:15,638 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-02 20:07:15,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-02 20:07:15,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:07:15,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:07:16,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-02 20:07:16,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:07:16,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:07:16,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:07:16,818 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:07:16,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-02 20:07:16,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:07:16,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:07:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 5631 proven. 29 refuted. 0 times theorem prover too weak. 62816 trivial. 0 not checked. [2022-11-02 20:07:17,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:07:17,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2820 (Array Int Int))) (not (= 800 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))) is different from false [2022-11-02 20:07:17,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2818 Int) (v_ArrVal_2820 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2022-11-02 20:07:19,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2818 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse2 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (= (select .cse1 .cse2) 800)))))) is different from false [2022-11-02 20:07:19,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2818 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse0 (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select .cse0 .cse1))) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse1 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2022-11-02 20:07:19,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2818 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse0 (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= (select .cse0 .cse1) 800)) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse1 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2022-11-02 20:07:19,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2818 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse0 (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))) v_ArrVal_2815)))) (or (not (= 800 (select .cse0 .cse1))) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse1 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2022-11-02 20:07:19,575 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2818 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse0 (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))) v_ArrVal_2815)))) (or (not (= 800 (select .cse0 .cse1))) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse1 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-11-02 20:07:19,597 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse4 .cse5))) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2818 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse0 (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))) v_ArrVal_2815)))) (or (not (= 800 (select .cse0 .cse1))) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse1 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) (= 800 .cse6)))) is different from false [2022-11-02 20:07:19,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse4 .cse5))) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2818 Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse1 (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse2 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse1 .cse2) 800)))))) (= 800 .cse6)))) is different from false [2022-11-02 20:07:19,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse6))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_2815)))) (or (= 800 .cse0) (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse3 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= 800 (select .cse2 .cse3))))))))) is different from false [2022-11-02 20:07:19,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807))) (let ((.cse3 (select .cse5 .cse6))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse2 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= 800 (select .cse1 .cse2))) (= .cse3 800))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse7 .cse6)))))) is different from false [2022-11-02 20:07:19,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (select .cse7 .cse4))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse1 (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse2 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse3 .cse4))) (= 800 .cse5) (not (= 800 (select .cse1 .cse2)))))))))) is different from false [2022-11-02 20:07:20,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (select .cse7 .cse3))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse1 (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2816) .cse3 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3))) (not (= (select .cse1 .cse3) 800))))))))) is different from false [2022-11-02 20:07:20,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2806 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse8 .cse1))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_2809) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse3 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_2815)))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse0 .cse1))) (= .cse2 800) (not (= (select .cse3 .cse1) 800)) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2816) .cse1 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))))) is different from false [2022-11-02 20:07:20,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:07:20,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 512 treesize of output 352 [2022-11-02 20:07:20,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:07:20,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 526 treesize of output 516 [2022-11-02 20:07:20,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 601 treesize of output 561 [2022-11-02 20:07:20,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 331 treesize of output 315 [2022-11-02 20:07:20,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 559 treesize of output 511 [2022-11-02 20:07:20,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:07:20,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:07:20,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 243 [2022-11-02 20:07:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 960 proven. 1753 refuted. 0 times theorem prover too weak. 62816 trivial. 2947 not checked. [2022-11-02 20:07:26,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385453876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:07:26,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:07:26,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 20, 31] total 184 [2022-11-02 20:07:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055203020] [2022-11-02 20:07:26,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:07:26,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 184 states [2022-11-02 20:07:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:26,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2022-11-02 20:07:26,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5018, Invalid=23739, Unknown=29, NotChecked=4886, Total=33672 [2022-11-02 20:07:26,307 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 231 [2022-11-02 20:07:26,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 852 transitions, 6800 flow. Second operand has 184 states, 184 states have (on average 158.2663043478261) internal successors, (29121), 184 states have internal predecessors, (29121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:07:26,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:26,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 231 [2022-11-02 20:07:26,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:28,328 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2806 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse8 .cse0))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_2809) .cse0 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse3 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse0) 4)) v_ArrVal_2815)))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse0))) (= .cse2 800) (not (= (select .cse3 .cse0) 800)) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:07:28,911 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse8 .cse4))) (and (<= .cse0 1) (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2816) .cse4 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| .cse0)) (not (= (select .cse2 .cse4) 800)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:07:29,469 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse8 .cse4))) (and (<= .cse0 1) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2816) .cse4 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| .cse0)) (not (= (select .cse2 .cse4) 800)))))))) (= |c_t1Thread1of1ForFork0_#t~post50#1| 0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:07:31,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse8 .cse4))) (and (<= .cse0 1) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2816) .cse4 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| .cse0)) (not (= (select .cse2 .cse4) 800)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-11-02 20:07:33,880 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse3 .cse4))) (= 800 .cse5) (not (= 800 (select .cse2 .cse0)))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1))) is different from false [2022-11-02 20:07:35,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807))) (let ((.cse3 (select .cse5 .cse6))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse0) 4)) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= 800 (select .cse2 .cse0))) (= .cse3 800))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse7 .cse6)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1))) is different from false [2022-11-02 20:07:41,938 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2806 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse8 .cse0))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_2809) .cse0 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse3 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse0) 4)) v_ArrVal_2815)))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse0))) (= .cse2 800) (not (= (select .cse3 .cse0) 800)) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1))) is different from false [2022-11-02 20:07:42,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2806 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse8 .cse0))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_2809) .cse0 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse3 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse0) 4)) v_ArrVal_2815)))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse0))) (= .cse2 800) (not (= (select .cse3 .cse0) 800)) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:07:43,749 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int)) (v_ArrVal_2806 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse8 .cse0))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_2809) .cse0 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse3 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse0) 4)) v_ArrVal_2815)))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse0))) (= .cse2 800) (not (= (select .cse3 .cse0) 800)) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1))) is different from false [2022-11-02 20:07:44,567 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse8 .cse4))) (and (<= .cse0 1) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2816) .cse4 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| .cse0)) (not (= (select .cse2 .cse4) 800)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:07:45,165 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse8 .cse4))) (and (<= .cse0 1) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2816) .cse4 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| .cse0)) (not (= (select .cse2 .cse4) 800)))))))) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:07:47,241 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse8 .cse4))) (and (<= .cse0 1) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2816) .cse4 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| .cse0)) (not (= (select .cse2 .cse4) 800)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:07:49,922 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse3 .cse4))) (= 800 .cse5) (not (= 800 (select .cse2 .cse0)))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:07:51,096 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (select .cse7 .cse4))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse3 .cse4))) (= 800 .cse5) (not (= 800 (select .cse2 .cse0)))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:07:53,590 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807))) (let ((.cse3 (select .cse5 .cse6))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse0) 4)) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= 800 (select .cse2 .cse0))) (= .cse3 800))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse7 .cse6)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:07:55,737 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2816 Int) (v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (v_ArrVal_2809 Int) (v_ArrVal_2820 (Array Int Int))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807))) (let ((.cse3 (select .cse5 .cse6))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2813))) (let ((.cse2 (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse0) 4)) v_ArrVal_2815)))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2816) .cse0 v_ArrVal_2818)) |c_~#stored_elements~0.base| v_ArrVal_2820) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= 800 (select .cse2 .cse0))) (= .cse3 800))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse7 .cse6)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false