./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --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-2329fc7 [2022-12-13 20:22:02,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:22:02,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:22:02,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:22:02,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:22:02,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:22:02,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:22:02,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:22:02,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:22:02,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:22:02,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:22:02,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:22:02,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:22:02,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:22:02,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:22:02,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:22:02,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:22:02,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:22:02,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:22:02,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:22:02,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:22:02,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:22:02,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:22:02,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:22:02,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:22:02,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:22:02,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:22:02,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:22:02,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:22:02,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:22:02,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:22:02,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:22:02,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:22:02,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:22:02,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:22:02,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:22:02,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:22:02,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:22:02,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:22:02,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:22:02,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:22:02,679 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 20:22:02,692 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:22:02,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:22:02,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:22:02,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:22:02,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:22:02,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:22:02,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:22:02,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:22:02,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 20:22:02,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:22:02,695 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 20:22:02,695 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:22:02,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:22:02,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:22:02,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:22:02,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:22:02,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:22:02,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:22:02,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:22:02,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:22:02,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:22:02,696 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:22:02,696 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:22:02,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:22:02,696 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:22:02,696 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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-12-13 20:22:02,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:22:02,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:22:02,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:22:02,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:22:02,883 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:22:02,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 20:22:05,461 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:22:05,695 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:22:05,696 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 20:22:05,708 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/data/9ee977655/7b1c36b3cc6f4a97a6aaf3643e606f61/FLAGd223fff3f [2022-12-13 20:22:06,035 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/data/9ee977655/7b1c36b3cc6f4a97a6aaf3643e606f61 [2022-12-13 20:22:06,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:22:06,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:22:06,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:22:06,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:22:06,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:22:06,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a692035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06, skipping insertion in model container [2022-12-13 20:22:06,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:22:06,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:22:06,397 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 20:22:06,401 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 20:22:06,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:22:06,414 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:22:06,457 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 20:22:06,460 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 20:22:06,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:22:06,508 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:22:06,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06 WrapperNode [2022-12-13 20:22:06,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:22:06,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:22:06,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:22:06,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:22:06,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,543 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-13 20:22:06,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:22:06,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:22:06,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:22:06,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:22:06,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:22:06,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:22:06,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:22:06,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:22:06,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (1/1) ... [2022-12-13 20:22:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:22:06,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:22:06,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:22:06,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:22:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 20:22:06,620 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 20:22:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 20:22:06,621 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 20:22:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:22:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:22:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:22:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:22:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 20:22:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:22:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:22:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:22:06,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:22:06,623 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 20:22:06,741 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:22:06,743 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:22:07,109 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:22:07,118 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:22:07,118 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 20:22:07,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:22:07 BoogieIcfgContainer [2022-12-13 20:22:07,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:22:07,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:22:07,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:22:07,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:22:07,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:22:06" (1/3) ... [2022-12-13 20:22:07,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d0d23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:22:07, skipping insertion in model container [2022-12-13 20:22:07,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:22:06" (2/3) ... [2022-12-13 20:22:07,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d0d23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:22:07, skipping insertion in model container [2022-12-13 20:22:07,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:22:07" (3/3) ... [2022-12-13 20:22:07,129 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-13 20:22:07,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:22:07,146 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-12-13 20:22:07,146 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:22:07,254 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 20:22:07,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-12-13 20:22:07,385 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-12-13 20:22:07,385 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 20:22:07,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 13/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 681 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-12-13 20:22:07,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 285 places, 291 transitions, 598 flow [2022-12-13 20:22:07,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 284 transitions, 580 flow [2022-12-13 20:22:07,404 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:22:07,414 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 284 transitions, 580 flow [2022-12-13 20:22:07,417 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 284 transitions, 580 flow [2022-12-13 20:22:07,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 284 transitions, 580 flow [2022-12-13 20:22:07,467 INFO L130 PetriNetUnfolder]: 13/284 cut-off events. [2022-12-13 20:22:07,467 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 20:22:07,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 284 events. 13/284 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 661 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-12-13 20:22:07,476 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-12-13 20:22:20,058 INFO L134 LiptonReduction]: Checked pairs total: 54635 [2022-12-13 20:22:20,058 INFO L136 LiptonReduction]: Total number of compositions: 362 [2022-12-13 20:22:20,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:22:20,077 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3341a9e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:22:20,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-12-13 20:22:20,079 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 20:22:20,079 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:22:20,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:20,079 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 20:22:20,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1211, now seen corresponding path program 1 times [2022-12-13 20:22:20,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:20,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284900531] [2022-12-13 20:22:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:20,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:20,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284900531] [2022-12-13 20:22:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284900531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:20,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:20,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 20:22:20,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814875554] [2022-12-13 20:22:20,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:20,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 20:22:20,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:20,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 20:22:20,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 20:22:20,187 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 653 [2022-12-13 20:22:20,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 280.5) internal successors, (561), 2 states have internal predecessors, (561), 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-12-13 20:22:20,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:20,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 653 [2022-12-13 20:22:20,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:20,797 INFO L130 PetriNetUnfolder]: 4154/6551 cut-off events. [2022-12-13 20:22:20,798 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-13 20:22:20,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12992 conditions, 6551 events. 4154/6551 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 37223 event pairs, 3633 based on Foata normal form. 0/3171 useless extension candidates. Maximal degree in co-relation 12518. Up to 6369 conditions per place. [2022-12-13 20:22:20,823 INFO L137 encePairwiseOnDemand]: 617/653 looper letters, 64 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2022-12-13 20:22:20,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 280 flow [2022-12-13 20:22:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 20:22:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 20:22:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 660 transitions. [2022-12-13 20:22:20,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5053598774885145 [2022-12-13 20:22:20,835 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 660 transitions. [2022-12-13 20:22:20,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 660 transitions. [2022-12-13 20:22:20,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:20,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 660 transitions. [2022-12-13 20:22:20,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 330.0) internal successors, (660), 2 states have internal predecessors, (660), 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-12-13 20:22:20,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 653.0) internal successors, (1959), 3 states have internal predecessors, (1959), 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-12-13 20:22:20,847 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 653.0) internal successors, (1959), 3 states have internal predecessors, (1959), 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-12-13 20:22:20,849 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 660 transitions. [2022-12-13 20:22:20,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 280 flow [2022-12-13 20:22:20,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 20:22:20,853 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2022-12-13 20:22:20,854 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2022-12-13 20:22:20,857 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2022-12-13 20:22:20,857 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2022-12-13 20:22:20,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 280.5) internal successors, (561), 2 states have internal predecessors, (561), 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-12-13 20:22:20,858 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:20,858 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 20:22:20,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:22:20,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1184368, now seen corresponding path program 1 times [2022-12-13 20:22:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:20,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577892863] [2022-12-13 20:22:20,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:20,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577892863] [2022-12-13 20:22:20,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577892863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:20,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:20,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:22:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382697867] [2022-12-13 20:22:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:20,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:20,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:21,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 653 [2022-12-13 20:22:21,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 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-12-13 20:22:21,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:21,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 653 [2022-12-13 20:22:21,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:21,580 INFO L130 PetriNetUnfolder]: 4104/6453 cut-off events. [2022-12-13 20:22:21,580 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 20:22:21,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12750 conditions, 6453 events. 4104/6453 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 36452 event pairs, 3589 based on Foata normal form. 0/3144 useless extension candidates. Maximal degree in co-relation 12747. Up to 6272 conditions per place. [2022-12-13 20:22:21,602 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 60 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2022-12-13 20:22:21,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 264 flow [2022-12-13 20:22:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2022-12-13 20:22:21,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4476773864216437 [2022-12-13 20:22:21,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 877 transitions. [2022-12-13 20:22:21,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 877 transitions. [2022-12-13 20:22:21,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:21,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 877 transitions. [2022-12-13 20:22:21,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-12-13 20:22:21,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:21,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:21,614 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 877 transitions. [2022-12-13 20:22:21,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 264 flow [2022-12-13 20:22:21,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:22:21,616 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2022-12-13 20:22:21,616 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2022-12-13 20:22:21,617 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2022-12-13 20:22:21,617 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2022-12-13 20:22:21,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 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-12-13 20:22:21,618 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:21,618 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 20:22:21,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:22:21,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1184369, now seen corresponding path program 1 times [2022-12-13 20:22:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:21,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855995002] [2022-12-13 20:22:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:21,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855995002] [2022-12-13 20:22:21,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855995002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:21,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:22:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526245983] [2022-12-13 20:22:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:21,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:21,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:21,836 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 653 [2022-12-13 20:22:21,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-12-13 20:22:21,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:21,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 653 [2022-12-13 20:22:21,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:22,437 INFO L130 PetriNetUnfolder]: 4054/6355 cut-off events. [2022-12-13 20:22:22,437 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 20:22:22,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12560 conditions, 6355 events. 4054/6355 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 35733 event pairs, 3545 based on Foata normal form. 0/3117 useless extension candidates. Maximal degree in co-relation 12556. Up to 6177 conditions per place. [2022-12-13 20:22:22,457 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 58 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2022-12-13 20:22:22,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 260 flow [2022-12-13 20:22:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2022-12-13 20:22:22,460 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45278203164880043 [2022-12-13 20:22:22,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2022-12-13 20:22:22,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2022-12-13 20:22:22,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:22,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2022-12-13 20:22:22,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 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-12-13 20:22:22,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:22,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:22,465 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 887 transitions. [2022-12-13 20:22:22,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 260 flow [2022-12-13 20:22:22,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:22:22,466 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2022-12-13 20:22:22,466 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2022-12-13 20:22:22,466 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2022-12-13 20:22:22,467 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2022-12-13 20:22:22,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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-12-13 20:22:22,467 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:22,467 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 20:22:22,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:22:22,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1138163353, now seen corresponding path program 1 times [2022-12-13 20:22:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:22,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186803074] [2022-12-13 20:22:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:22,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:22,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:22,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186803074] [2022-12-13 20:22:22,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186803074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:22,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:22,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:22:22,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088073787] [2022-12-13 20:22:22,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:22,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:22,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:22,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:22,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:22,723 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 653 [2022-12-13 20:22:22,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 279.6666666666667) internal successors, (839), 3 states have internal predecessors, (839), 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-12-13 20:22:22,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:22,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 653 [2022-12-13 20:22:22,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:23,197 INFO L130 PetriNetUnfolder]: 3441/5394 cut-off events. [2022-12-13 20:22:23,198 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 20:22:23,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10649 conditions, 5394 events. 3441/5394 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 29272 event pairs, 2972 based on Foata normal form. 0/2818 useless extension candidates. Maximal degree in co-relation 10645. Up to 5229 conditions per place. [2022-12-13 20:22:23,211 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 55 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2022-12-13 20:22:23,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 244 flow [2022-12-13 20:22:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2022-12-13 20:22:23,213 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4563552833078101 [2022-12-13 20:22:23,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2022-12-13 20:22:23,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2022-12-13 20:22:23,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:23,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2022-12-13 20:22:23,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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-12-13 20:22:23,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:23,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:23,218 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 894 transitions. [2022-12-13 20:22:23,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 244 flow [2022-12-13 20:22:23,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:22:23,219 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 130 flow [2022-12-13 20:22:23,219 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2022-12-13 20:22:23,220 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2022-12-13 20:22:23,220 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 130 flow [2022-12-13 20:22:23,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.6666666666667) internal successors, (839), 3 states have internal predecessors, (839), 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-12-13 20:22:23,220 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:23,221 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 20:22:23,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:22:23,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1138163355, now seen corresponding path program 1 times [2022-12-13 20:22:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086520474] [2022-12-13 20:22:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:23,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086520474] [2022-12-13 20:22:23,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086520474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:23,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:23,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:22:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505815910] [2022-12-13 20:22:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:23,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:23,405 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 653 [2022-12-13 20:22:23,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 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-12-13 20:22:23,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:23,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 653 [2022-12-13 20:22:23,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:23,699 INFO L130 PetriNetUnfolder]: 3002/4705 cut-off events. [2022-12-13 20:22:23,699 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 20:22:23,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9281 conditions, 4705 events. 3002/4705 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 24786 event pairs, 2565 based on Foata normal form. 0/2593 useless extension candidates. Maximal degree in co-relation 9277. Up to 4551 conditions per place. [2022-12-13 20:22:23,711 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 51 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-12-13 20:22:23,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 230 flow [2022-12-13 20:22:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2022-12-13 20:22:23,713 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45278203164880043 [2022-12-13 20:22:23,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2022-12-13 20:22:23,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2022-12-13 20:22:23,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:23,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2022-12-13 20:22:23,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 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-12-13 20:22:23,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:23,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:23,718 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 130 flow. Second operand 3 states and 887 transitions. [2022-12-13 20:22:23,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 230 flow [2022-12-13 20:22:23,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 59 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:22:23,719 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 127 flow [2022-12-13 20:22:23,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2022-12-13 20:22:23,720 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2022-12-13 20:22:23,720 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 127 flow [2022-12-13 20:22:23,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 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-12-13 20:22:23,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:23,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 20:22:23,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:22:23,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1138163351, now seen corresponding path program 1 times [2022-12-13 20:22:23,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:23,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727055566] [2022-12-13 20:22:23,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:23,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:24,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727055566] [2022-12-13 20:22:24,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727055566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:24,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:24,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:22:24,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95240504] [2022-12-13 20:22:24,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:24,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:24,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 653 [2022-12-13 20:22:24,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 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-12-13 20:22:24,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:24,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 653 [2022-12-13 20:22:24,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:25,059 INFO L130 PetriNetUnfolder]: 3166/4953 cut-off events. [2022-12-13 20:22:25,059 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 20:22:25,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9784 conditions, 4953 events. 3166/4953 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 26001 event pairs, 2188 based on Foata normal form. 0/2668 useless extension candidates. Maximal degree in co-relation 9780. Up to 4797 conditions per place. [2022-12-13 20:22:25,071 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 59 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2022-12-13 20:22:25,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 271 flow [2022-12-13 20:22:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2022-12-13 20:22:25,073 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4446145992853497 [2022-12-13 20:22:25,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 871 transitions. [2022-12-13 20:22:25,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions. [2022-12-13 20:22:25,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:25,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions. [2022-12-13 20:22:25,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 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-12-13 20:22:25,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:25,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:25,077 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 3 states and 871 transitions. [2022-12-13 20:22:25,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 271 flow [2022-12-13 20:22:25,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:22:25,078 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 149 flow [2022-12-13 20:22:25,079 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2022-12-13 20:22:25,079 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -46 predicate places. [2022-12-13 20:22:25,079 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 149 flow [2022-12-13 20:22:25,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 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-12-13 20:22:25,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:25,080 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 20:22:25,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:22:25,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1138205808, now seen corresponding path program 1 times [2022-12-13 20:22:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:25,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253791781] [2022-12-13 20:22:25,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:25,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:25,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253791781] [2022-12-13 20:22:25,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253791781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:25,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:25,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:22:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324355545] [2022-12-13 20:22:25,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:22:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:22:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:22:25,295 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 653 [2022-12-13 20:22:25,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 274.25) internal successors, (1097), 4 states have internal predecessors, (1097), 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-12-13 20:22:25,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:25,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 653 [2022-12-13 20:22:25,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:25,667 INFO L130 PetriNetUnfolder]: 2185/3487 cut-off events. [2022-12-13 20:22:25,667 INFO L131 PetriNetUnfolder]: For 164/223 co-relation queries the response was YES. [2022-12-13 20:22:25,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 3487 events. 2185/3487 cut-off events. For 164/223 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17860 event pairs, 1837 based on Foata normal form. 0/2144 useless extension candidates. Maximal degree in co-relation 7045. Up to 3369 conditions per place. [2022-12-13 20:22:25,678 INFO L137 encePairwiseOnDemand]: 650/653 looper letters, 52 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-12-13 20:22:25,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 255 flow [2022-12-13 20:22:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2022-12-13 20:22:25,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4451250638080653 [2022-12-13 20:22:25,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 872 transitions. [2022-12-13 20:22:25,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions. [2022-12-13 20:22:25,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:25,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions. [2022-12-13 20:22:25,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 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-12-13 20:22:25,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:25,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:25,685 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 149 flow. Second operand 3 states and 872 transitions. [2022-12-13 20:22:25,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 255 flow [2022-12-13 20:22:25,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:22:25,687 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 147 flow [2022-12-13 20:22:25,687 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2022-12-13 20:22:25,688 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -46 predicate places. [2022-12-13 20:22:25,688 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 147 flow [2022-12-13 20:22:25,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 274.25) internal successors, (1097), 4 states have internal predecessors, (1097), 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-12-13 20:22:25,688 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:25,688 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 20:22:25,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:22:25,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1138205807, now seen corresponding path program 1 times [2022-12-13 20:22:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:25,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469392168] [2022-12-13 20:22:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:25,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:25,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469392168] [2022-12-13 20:22:25,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469392168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:25,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:25,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:22:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509103675] [2022-12-13 20:22:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:25,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:22:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:25,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:22:25,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:22:25,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 653 [2022-12-13 20:22:25,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 268.25) internal successors, (1073), 4 states have internal predecessors, (1073), 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-12-13 20:22:25,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:25,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 653 [2022-12-13 20:22:25,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:26,076 INFO L130 PetriNetUnfolder]: 1362/2261 cut-off events. [2022-12-13 20:22:26,076 INFO L131 PetriNetUnfolder]: For 122/161 co-relation queries the response was YES. [2022-12-13 20:22:26,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 2261 events. 1362/2261 cut-off events. For 122/161 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11204 event pairs, 1120 based on Foata normal form. 0/1606 useless extension candidates. Maximal degree in co-relation 4579. Up to 2178 conditions per place. [2022-12-13 20:22:26,081 INFO L137 encePairwiseOnDemand]: 650/653 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2022-12-13 20:22:26,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 251 flow [2022-12-13 20:22:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2022-12-13 20:22:26,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43542623787646756 [2022-12-13 20:22:26,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 853 transitions. [2022-12-13 20:22:26,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 853 transitions. [2022-12-13 20:22:26,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:26,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 853 transitions. [2022-12-13 20:22:26,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-12-13 20:22:26,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:26,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:26,086 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 147 flow. Second operand 3 states and 853 transitions. [2022-12-13 20:22:26,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 251 flow [2022-12-13 20:22:26,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:22:26,088 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 145 flow [2022-12-13 20:22:26,088 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2022-12-13 20:22:26,088 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2022-12-13 20:22:26,088 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 145 flow [2022-12-13 20:22:26,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 268.25) internal successors, (1073), 4 states have internal predecessors, (1073), 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-12-13 20:22:26,089 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:26,089 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 20:22:26,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:22:26,089 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 923369062, now seen corresponding path program 1 times [2022-12-13 20:22:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:26,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641532884] [2022-12-13 20:22:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:26,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641532884] [2022-12-13 20:22:26,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641532884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:26,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:26,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:22:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756729627] [2022-12-13 20:22:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:26,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:22:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:22:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:22:26,591 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 653 [2022-12-13 20:22:26,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 266.5) internal successors, (1066), 4 states have internal predecessors, (1066), 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-12-13 20:22:26,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:26,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 653 [2022-12-13 20:22:26,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:26,926 INFO L130 PetriNetUnfolder]: 1766/2914 cut-off events. [2022-12-13 20:22:26,926 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-13 20:22:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5963 conditions, 2914 events. 1766/2914 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15241 event pairs, 428 based on Foata normal form. 27/2061 useless extension candidates. Maximal degree in co-relation 5958. Up to 2294 conditions per place. [2022-12-13 20:22:26,934 INFO L137 encePairwiseOnDemand]: 647/653 looper letters, 76 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2022-12-13 20:22:26,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 376 flow [2022-12-13 20:22:26,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:22:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:22:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1142 transitions. [2022-12-13 20:22:26,937 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43721286370597245 [2022-12-13 20:22:26,937 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1142 transitions. [2022-12-13 20:22:26,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1142 transitions. [2022-12-13 20:22:26,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:26,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1142 transitions. [2022-12-13 20:22:26,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 285.5) internal successors, (1142), 4 states have internal predecessors, (1142), 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-12-13 20:22:26,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 653.0) internal successors, (3265), 5 states have internal predecessors, (3265), 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-12-13 20:22:26,945 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 653.0) internal successors, (3265), 5 states have internal predecessors, (3265), 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-12-13 20:22:26,945 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 145 flow. Second operand 4 states and 1142 transitions. [2022-12-13 20:22:26,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 376 flow [2022-12-13 20:22:26,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:22:26,947 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 184 flow [2022-12-13 20:22:26,948 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2022-12-13 20:22:26,948 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2022-12-13 20:22:26,948 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 184 flow [2022-12-13 20:22:26,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 266.5) internal successors, (1066), 4 states have internal predecessors, (1066), 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-12-13 20:22:26,949 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:26,949 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 20:22:26,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:22:26,949 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash 923326521, now seen corresponding path program 1 times [2022-12-13 20:22:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:26,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352542190] [2022-12-13 20:22:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:27,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352542190] [2022-12-13 20:22:27,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352542190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:27,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:27,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:22:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820423302] [2022-12-13 20:22:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:27,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:22:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:27,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:22:27,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:22:27,332 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 653 [2022-12-13 20:22:27,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 269.5) internal successors, (1078), 4 states have internal predecessors, (1078), 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-12-13 20:22:27,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:27,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 653 [2022-12-13 20:22:27,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:27,681 INFO L130 PetriNetUnfolder]: 1785/3049 cut-off events. [2022-12-13 20:22:27,681 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2022-12-13 20:22:27,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6349 conditions, 3049 events. 1785/3049 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 16649 event pairs, 747 based on Foata normal form. 72/2362 useless extension candidates. Maximal degree in co-relation 6343. Up to 1775 conditions per place. [2022-12-13 20:22:27,691 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 84 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2022-12-13 20:22:27,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 95 transitions, 422 flow [2022-12-13 20:22:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:22:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:22:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1157 transitions. [2022-12-13 20:22:27,693 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44295558958652376 [2022-12-13 20:22:27,693 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1157 transitions. [2022-12-13 20:22:27,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1157 transitions. [2022-12-13 20:22:27,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:27,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1157 transitions. [2022-12-13 20:22:27,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 289.25) internal successors, (1157), 4 states have internal predecessors, (1157), 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-12-13 20:22:27,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 653.0) internal successors, (3265), 5 states have internal predecessors, (3265), 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-12-13 20:22:27,698 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 653.0) internal successors, (3265), 5 states have internal predecessors, (3265), 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-12-13 20:22:27,698 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 184 flow. Second operand 4 states and 1157 transitions. [2022-12-13 20:22:27,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 95 transitions, 422 flow [2022-12-13 20:22:27,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:22:27,700 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 179 flow [2022-12-13 20:22:27,700 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2022-12-13 20:22:27,700 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2022-12-13 20:22:27,700 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 179 flow [2022-12-13 20:22:27,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 269.5) internal successors, (1078), 4 states have internal predecessors, (1078), 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-12-13 20:22:27,701 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:27,701 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:27,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:22:27,701 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1864464397, now seen corresponding path program 1 times [2022-12-13 20:22:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:27,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120345758] [2022-12-13 20:22:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:27,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:27,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120345758] [2022-12-13 20:22:27,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120345758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:27,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:27,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:22:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940258928] [2022-12-13 20:22:27,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:27,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:27,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:27,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:27,742 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 653 [2022-12-13 20:22:27,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 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-12-13 20:22:27,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:27,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 653 [2022-12-13 20:22:27,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:27,905 INFO L130 PetriNetUnfolder]: 620/1229 cut-off events. [2022-12-13 20:22:27,905 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-13 20:22:27,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1229 events. 620/1229 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6278 event pairs, 391 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 2542. Up to 643 conditions per place. [2022-12-13 20:22:27,908 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 64 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2022-12-13 20:22:27,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 342 flow [2022-12-13 20:22:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2022-12-13 20:22:27,910 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45278203164880043 [2022-12-13 20:22:27,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2022-12-13 20:22:27,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2022-12-13 20:22:27,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:27,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2022-12-13 20:22:27,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 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-12-13 20:22:27,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:27,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:27,913 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 179 flow. Second operand 3 states and 887 transitions. [2022-12-13 20:22:27,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 342 flow [2022-12-13 20:22:27,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:22:27,915 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 180 flow [2022-12-13 20:22:27,915 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2022-12-13 20:22:27,915 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2022-12-13 20:22:27,915 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 180 flow [2022-12-13 20:22:27,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 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-12-13 20:22:27,916 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:27,916 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:27,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:22:27,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash 180931921, now seen corresponding path program 1 times [2022-12-13 20:22:27,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:27,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540547086] [2022-12-13 20:22:27,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:28,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:28,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540547086] [2022-12-13 20:22:28,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540547086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:28,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:28,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:22:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510057418] [2022-12-13 20:22:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:28,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:22:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:22:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:22:28,157 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 653 [2022-12-13 20:22:28,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 276.5) internal successors, (1106), 4 states have internal predecessors, (1106), 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-12-13 20:22:28,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:28,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 653 [2022-12-13 20:22:28,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:28,314 INFO L130 PetriNetUnfolder]: 473/934 cut-off events. [2022-12-13 20:22:28,314 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-13 20:22:28,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 934 events. 473/934 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4385 event pairs, 302 based on Foata normal form. 10/841 useless extension candidates. Maximal degree in co-relation 2000. Up to 655 conditions per place. [2022-12-13 20:22:28,316 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 65 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2022-12-13 20:22:28,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 349 flow [2022-12-13 20:22:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:22:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:22:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1163 transitions. [2022-12-13 20:22:28,319 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44525267993874423 [2022-12-13 20:22:28,319 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1163 transitions. [2022-12-13 20:22:28,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1163 transitions. [2022-12-13 20:22:28,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:28,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1163 transitions. [2022-12-13 20:22:28,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 290.75) internal successors, (1163), 4 states have internal predecessors, (1163), 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-12-13 20:22:28,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 653.0) internal successors, (3265), 5 states have internal predecessors, (3265), 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-12-13 20:22:28,327 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 653.0) internal successors, (3265), 5 states have internal predecessors, (3265), 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-12-13 20:22:28,327 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 180 flow. Second operand 4 states and 1163 transitions. [2022-12-13 20:22:28,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 349 flow [2022-12-13 20:22:28,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 341 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 20:22:28,330 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 184 flow [2022-12-13 20:22:28,330 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2022-12-13 20:22:28,330 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2022-12-13 20:22:28,331 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 184 flow [2022-12-13 20:22:28,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 276.5) internal successors, (1106), 4 states have internal predecessors, (1106), 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-12-13 20:22:28,331 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:28,331 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:28,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:22:28,331 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash 180931920, now seen corresponding path program 1 times [2022-12-13 20:22:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:28,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777478861] [2022-12-13 20:22:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:28,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:28,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777478861] [2022-12-13 20:22:28,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777478861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:28,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:28,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:22:28,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862319122] [2022-12-13 20:22:28,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:28,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:22:28,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:28,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:22:28,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:22:28,502 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 653 [2022-12-13 20:22:28,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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-12-13 20:22:28,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:28,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 653 [2022-12-13 20:22:28,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:28,604 INFO L130 PetriNetUnfolder]: 443/875 cut-off events. [2022-12-13 20:22:28,604 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-13 20:22:28,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 875 events. 443/875 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3997 event pairs, 375 based on Foata normal form. 20/820 useless extension candidates. Maximal degree in co-relation 1905. Up to 805 conditions per place. [2022-12-13 20:22:28,606 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 48 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-13 20:22:28,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 282 flow [2022-12-13 20:22:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:22:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:22:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2022-12-13 20:22:28,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44308320571720267 [2022-12-13 20:22:28,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 868 transitions. [2022-12-13 20:22:28,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 868 transitions. [2022-12-13 20:22:28,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:28,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 868 transitions. [2022-12-13 20:22:28,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 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-12-13 20:22:28,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:28,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:22:28,611 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 184 flow. Second operand 3 states and 868 transitions. [2022-12-13 20:22:28,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 282 flow [2022-12-13 20:22:28,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:22:28,613 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 182 flow [2022-12-13 20:22:28,613 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2022-12-13 20:22:28,613 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2022-12-13 20:22:28,613 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 182 flow [2022-12-13 20:22:28,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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-12-13 20:22:28,613 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:28,613 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:28,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:22:28,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1313925938, now seen corresponding path program 1 times [2022-12-13 20:22:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:28,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866062201] [2022-12-13 20:22:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:28,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:28,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866062201] [2022-12-13 20:22:28,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866062201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:22:28,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381808073] [2022-12-13 20:22:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:28,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:22:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:22:28,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:22:28,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:22:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:28,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 20:22:28,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:22:29,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:22:29,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:22:29,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:22:29,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-12-13 20:22:29,149 INFO L350 Elim1Store]: Elim1 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-12-13 20:22:29,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:22:29,214 INFO L350 Elim1Store]: Elim1 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-12-13 20:22:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:29,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:22:29,272 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_415 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_415) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_415 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_415) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:22:29,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:22:29,283 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 27 [2022-12-13 20:22:29,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:22:29,291 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 43 [2022-12-13 20:22:29,306 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-12-13 20:22:29,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:22:29,313 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2022-12-13 20:22:29,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:22:29,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:22:29,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-13 20:22:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:29,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381808073] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:22:29,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:22:29,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 20:22:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134118838] [2022-12-13 20:22:29,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:22:29,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 20:22:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:29,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 20:22:29,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=180, Unknown=1, NotChecked=28, Total=272 [2022-12-13 20:22:29,661 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 653 [2022-12-13 20:22:29,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 182 flow. Second operand has 17 states, 17 states have (on average 189.11764705882354) internal successors, (3215), 17 states have internal predecessors, (3215), 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-12-13 20:22:29,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:29,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 653 [2022-12-13 20:22:29,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:30,313 INFO L130 PetriNetUnfolder]: 661/1285 cut-off events. [2022-12-13 20:22:30,313 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-12-13 20:22:30,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2840 conditions, 1285 events. 661/1285 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6646 event pairs, 215 based on Foata normal form. 10/1187 useless extension candidates. Maximal degree in co-relation 2831. Up to 683 conditions per place. [2022-12-13 20:22:30,316 INFO L137 encePairwiseOnDemand]: 644/653 looper letters, 99 selfloop transitions, 14 changer transitions 0/117 dead transitions. [2022-12-13 20:22:30,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 566 flow [2022-12-13 20:22:30,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:22:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 20:22:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2022-12-13 20:22:30,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3054279394248766 [2022-12-13 20:22:30,320 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2022-12-13 20:22:30,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2022-12-13 20:22:30,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:30,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2022-12-13 20:22:30,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 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-12-13 20:22:30,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 653.0) internal successors, (6530), 10 states have internal predecessors, (6530), 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-12-13 20:22:30,327 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 653.0) internal successors, (6530), 10 states have internal predecessors, (6530), 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-12-13 20:22:30,327 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 182 flow. Second operand 9 states and 1795 transitions. [2022-12-13 20:22:30,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 566 flow [2022-12-13 20:22:30,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 117 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:22:30,329 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 257 flow [2022-12-13 20:22:30,329 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2022-12-13 20:22:30,330 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -33 predicate places. [2022-12-13 20:22:30,330 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 257 flow [2022-12-13 20:22:30,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 189.11764705882354) internal successors, (3215), 17 states have internal predecessors, (3215), 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-12-13 20:22:30,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:30,330 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:30,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:22:30,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 20:22:30,532 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:30,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2076997323, now seen corresponding path program 1 times [2022-12-13 20:22:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:30,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510380288] [2022-12-13 20:22:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:31,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510380288] [2022-12-13 20:22:31,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510380288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:22:31,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:22:31,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:22:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063214176] [2022-12-13 20:22:31,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:22:31,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:22:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:31,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:22:31,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:22:31,510 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 653 [2022-12-13 20:22:31,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 267.6) internal successors, (1338), 5 states have internal predecessors, (1338), 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-12-13 20:22:31,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:31,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 653 [2022-12-13 20:22:31,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:22:31,869 INFO L130 PetriNetUnfolder]: 635/1260 cut-off events. [2022-12-13 20:22:31,869 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-12-13 20:22:31,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 1260 events. 635/1260 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6550 event pairs, 514 based on Foata normal form. 1/1185 useless extension candidates. Maximal degree in co-relation 2978. Up to 1158 conditions per place. [2022-12-13 20:22:31,872 INFO L137 encePairwiseOnDemand]: 646/653 looper letters, 64 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2022-12-13 20:22:31,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 78 transitions, 442 flow [2022-12-13 20:22:31,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:22:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:22:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1654 transitions. [2022-12-13 20:22:31,875 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4221541602858601 [2022-12-13 20:22:31,875 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1654 transitions. [2022-12-13 20:22:31,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1654 transitions. [2022-12-13 20:22:31,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:22:31,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1654 transitions. [2022-12-13 20:22:31,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 275.6666666666667) internal successors, (1654), 6 states have internal predecessors, (1654), 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-12-13 20:22:31,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 653.0) internal successors, (4571), 7 states have internal predecessors, (4571), 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-12-13 20:22:31,879 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 653.0) internal successors, (4571), 7 states have internal predecessors, (4571), 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-12-13 20:22:31,879 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 257 flow. Second operand 6 states and 1654 transitions. [2022-12-13 20:22:31,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 78 transitions, 442 flow [2022-12-13 20:22:31,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 428 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 20:22:31,882 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 298 flow [2022-12-13 20:22:31,882 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2022-12-13 20:22:31,882 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -29 predicate places. [2022-12-13 20:22:31,882 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 298 flow [2022-12-13 20:22:31,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 267.6) internal successors, (1338), 5 states have internal predecessors, (1338), 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-12-13 20:22:31,883 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:22:31,883 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:22:31,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:22:31,883 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:22:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:22:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2036830313, now seen corresponding path program 1 times [2022-12-13 20:22:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:22:31,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121264980] [2022-12-13 20:22:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:22:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:32,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:22:32,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121264980] [2022-12-13 20:22:32,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121264980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:22:32,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295792257] [2022-12-13 20:22:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:22:32,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:22:32,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:22:32,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:22:32,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:22:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:22:32,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 20:22:32,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:22:32,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:22:32,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:22:32,472 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:22:32,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-13 20:22:32,483 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:22:32,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-12-13 20:22:32,575 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-13 20:22:32,673 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 42 treesize of output 37 [2022-12-13 20:22:32,827 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 48 [2022-12-13 20:22:32,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:22:32,878 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 76 [2022-12-13 20:22:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:32,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:22:32,947 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_542 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_542) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_542 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_542) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:22:33,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:22:33,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 91 treesize of output 95 [2022-12-13 20:22:45,462 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:22:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:22:47,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295792257] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:22:47,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:22:47,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-13 20:22:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876834630] [2022-12-13 20:22:47,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:22:47,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 20:22:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:22:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 20:22:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=459, Unknown=17, NotChecked=46, Total=650 [2022-12-13 20:22:48,239 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 653 [2022-12-13 20:22:48,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 298 flow. Second operand has 26 states, 26 states have (on average 185.5) internal successors, (4823), 26 states have internal predecessors, (4823), 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-12-13 20:22:48,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:22:48,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 653 [2022-12-13 20:22:48,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:23:03,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:23:12,600 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 109 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:23:22,304 INFO L130 PetriNetUnfolder]: 830/1651 cut-off events. [2022-12-13 20:23:22,304 INFO L131 PetriNetUnfolder]: For 746/746 co-relation queries the response was YES. [2022-12-13 20:23:22,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4018 conditions, 1651 events. 830/1651 cut-off events. For 746/746 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9310 event pairs, 573 based on Foata normal form. 11/1565 useless extension candidates. Maximal degree in co-relation 4004. Up to 1218 conditions per place. [2022-12-13 20:23:22,308 INFO L137 encePairwiseOnDemand]: 635/653 looper letters, 108 selfloop transitions, 45 changer transitions 0/157 dead transitions. [2022-12-13 20:23:22,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 157 transitions, 942 flow [2022-12-13 20:23:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 20:23:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 20:23:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3823 transitions. [2022-12-13 20:23:22,314 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.29272588055130166 [2022-12-13 20:23:22,314 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3823 transitions. [2022-12-13 20:23:22,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3823 transitions. [2022-12-13 20:23:22,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:23:22,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3823 transitions. [2022-12-13 20:23:22,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 191.15) internal successors, (3823), 20 states have internal predecessors, (3823), 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-12-13 20:23:22,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 653.0) internal successors, (13713), 21 states have internal predecessors, (13713), 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-12-13 20:23:22,327 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 653.0) internal successors, (13713), 21 states have internal predecessors, (13713), 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-12-13 20:23:22,327 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 298 flow. Second operand 20 states and 3823 transitions. [2022-12-13 20:23:22,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 157 transitions, 942 flow [2022-12-13 20:23:22,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 157 transitions, 912 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 20:23:22,331 INFO L231 Difference]: Finished difference. Result has 103 places, 106 transitions, 650 flow [2022-12-13 20:23:22,331 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=650, PETRI_PLACES=103, PETRI_TRANSITIONS=106} [2022-12-13 20:23:22,331 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -3 predicate places. [2022-12-13 20:23:22,331 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 106 transitions, 650 flow [2022-12-13 20:23:22,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 185.5) internal successors, (4823), 26 states have internal predecessors, (4823), 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-12-13 20:23:22,332 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:23:22,332 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:23:22,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 20:23:22,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 20:23:22,533 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:23:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:23:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash -739999016, now seen corresponding path program 1 times [2022-12-13 20:23:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:23:22,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417641865] [2022-12-13 20:23:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:23:22,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:23:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:23:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:23:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:23:23,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417641865] [2022-12-13 20:23:23,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417641865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:23:23,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934816990] [2022-12-13 20:23:23,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:23:23,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:23:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:23:23,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:23:23,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:23:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:23:23,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 20:23:23,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:23:23,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-12-13 20:23:23,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:23,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:23,325 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:23:23,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-13 20:23:23,345 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:23:23,345 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2022-12-13 20:23:23,414 INFO L350 Elim1Store]: Elim1 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-12-13 20:23:23,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:23:23,502 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 20:23:23,502 INFO L350 Elim1Store]: Elim1 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-12-13 20:23:23,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:23,624 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 29 [2022-12-13 20:23:23,731 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 22 [2022-12-13 20:23:23,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:23,789 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 29 [2022-12-13 20:23:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:23:23,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:23:23,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_635 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_635) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_635 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_635) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:23:23,953 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_635 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_635) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_635 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_635) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:23:23,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_632 Int) (v_ArrVal_635 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_632) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_635) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_632 Int) (v_ArrVal_635 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_632) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_635) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-12-13 20:23:23,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:23:23,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 91 treesize of output 95 [2022-12-13 20:23:30,118 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:23:36,385 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 Int) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| Int) (v_ArrVal_629 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_628))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| 4) |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (<= 0 .cse0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_79| (select .cse1 .cse2))) (< (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 .cse0 v_ArrVal_629))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_632) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_635) |c_~#queue~0.base|) .cse2) 4) 3209))))) is different from false [2022-12-13 20:23:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:23:36,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934816990] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:23:36,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:23:36,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 26 [2022-12-13 20:23:36,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578448828] [2022-12-13 20:23:36,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:23:36,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 20:23:36,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:23:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 20:23:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=452, Unknown=9, NotChecked=188, Total=756 [2022-12-13 20:23:36,608 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 20:23:36,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 650 flow. Second operand has 28 states, 28 states have (on average 180.5) internal successors, (5054), 28 states have internal predecessors, (5054), 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-12-13 20:23:36,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:23:36,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 20:23:36,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:23:50,017 INFO L130 PetriNetUnfolder]: 1350/2692 cut-off events. [2022-12-13 20:23:50,017 INFO L131 PetriNetUnfolder]: For 3053/3053 co-relation queries the response was YES. [2022-12-13 20:23:50,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7964 conditions, 2692 events. 1350/2692 cut-off events. For 3053/3053 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16741 event pairs, 529 based on Foata normal form. 28/2585 useless extension candidates. Maximal degree in co-relation 7940. Up to 973 conditions per place. [2022-12-13 20:23:50,026 INFO L137 encePairwiseOnDemand]: 634/653 looper letters, 180 selfloop transitions, 58 changer transitions 0/242 dead transitions. [2022-12-13 20:23:50,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 242 transitions, 1708 flow [2022-12-13 20:23:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:23:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 20:23:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2339 transitions. [2022-12-13 20:23:50,029 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.29849412965798877 [2022-12-13 20:23:50,030 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2339 transitions. [2022-12-13 20:23:50,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2339 transitions. [2022-12-13 20:23:50,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:23:50,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2339 transitions. [2022-12-13 20:23:50,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 194.91666666666666) internal successors, (2339), 12 states have internal predecessors, (2339), 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-12-13 20:23:50,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 653.0) internal successors, (8489), 13 states have internal predecessors, (8489), 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-12-13 20:23:50,037 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 653.0) internal successors, (8489), 13 states have internal predecessors, (8489), 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-12-13 20:23:50,037 INFO L175 Difference]: Start difference. First operand has 103 places, 106 transitions, 650 flow. Second operand 12 states and 2339 transitions. [2022-12-13 20:23:50,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 242 transitions, 1708 flow [2022-12-13 20:23:50,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 242 transitions, 1586 flow, removed 49 selfloop flow, removed 6 redundant places. [2022-12-13 20:23:50,046 INFO L231 Difference]: Finished difference. Result has 114 places, 136 transitions, 972 flow [2022-12-13 20:23:50,046 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=972, PETRI_PLACES=114, PETRI_TRANSITIONS=136} [2022-12-13 20:23:50,046 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 8 predicate places. [2022-12-13 20:23:50,046 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 136 transitions, 972 flow [2022-12-13 20:23:50,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 180.5) internal successors, (5054), 28 states have internal predecessors, (5054), 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-12-13 20:23:50,047 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:23:50,047 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:23:50,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:23:50,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 20:23:50,248 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:23:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:23:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1282770828, now seen corresponding path program 2 times [2022-12-13 20:23:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:23:50,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319561418] [2022-12-13 20:23:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:23:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:23:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:23:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:23:50,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:23:50,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319561418] [2022-12-13 20:23:50,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319561418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:23:50,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672443994] [2022-12-13 20:23:50,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:23:50,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:23:50,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:23:50,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:23:50,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:23:51,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:23:51,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:23:51,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-13 20:23:51,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:23:51,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:51,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:51,091 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:23:51,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-13 20:23:51,121 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:23:51,121 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2022-12-13 20:23:51,287 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-13 20:23:51,456 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 42 treesize of output 37 [2022-12-13 20:23:51,704 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 48 [2022-12-13 20:23:51,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:23:51,794 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 76 [2022-12-13 20:23:51,873 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 76 [2022-12-13 20:23:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:23:51,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:23:51,991 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_732 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_732) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_732 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_732) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:23:52,003 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_732) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_732) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-12-13 20:23:52,021 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_732) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_732) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-13 20:23:52,040 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_732) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_732 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_732) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:23:53,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:23:53,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 97 treesize of output 101 [2022-12-13 20:24:05,322 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:24:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:24:05,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672443994] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:24:05,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:24:05,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-13 20:24:05,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727953117] [2022-12-13 20:24:05,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:24:05,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 20:24:05,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:24:05,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 20:24:05,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=486, Unknown=12, NotChecked=196, Total=812 [2022-12-13 20:24:06,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 20:24:06,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 136 transitions, 972 flow. Second operand has 29 states, 29 states have (on average 180.44827586206895) internal successors, (5233), 29 states have internal predecessors, (5233), 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-12-13 20:24:06,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:24:06,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 20:24:06,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:24:26,956 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 88 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:24:39,005 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 98 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:24:41,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:25:08,383 WARN L233 SmtUtils]: Spent 26.56s on a formula simplification. DAG size of input: 118 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:25:11,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:25:15,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:25:16,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:25:20,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:25:51,653 WARN L233 SmtUtils]: Spent 28.38s on a formula simplification. DAG size of input: 118 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:25:53,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:25:56,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:25:57,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:26:00,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:26:34,369 WARN L233 SmtUtils]: Spent 23.74s on a formula simplification. DAG size of input: 93 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:26:36,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:26:39,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:26:41,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:26:43,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:26:46,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:27:07,878 WARN L233 SmtUtils]: Spent 16.76s on a formula simplification. DAG size of input: 88 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:27:40,609 WARN L233 SmtUtils]: Spent 27.51s on a formula simplification. DAG size of input: 125 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:27:42,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:27:45,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:27:52,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:27:54,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:27:56,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:28:00,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:28:02,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:28:05,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:28:07,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:28:14,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:28:37,745 WARN L233 SmtUtils]: Spent 22.09s on a formula simplification. DAG size of input: 88 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:28:40,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:28:42,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:28:43,636 INFO L130 PetriNetUnfolder]: 1931/3797 cut-off events. [2022-12-13 20:28:43,636 INFO L131 PetriNetUnfolder]: For 8866/8866 co-relation queries the response was YES. [2022-12-13 20:28:43,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13623 conditions, 3797 events. 1931/3797 cut-off events. For 8866/8866 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 24861 event pairs, 627 based on Foata normal form. 18/3656 useless extension candidates. Maximal degree in co-relation 13593. Up to 1899 conditions per place. [2022-12-13 20:28:43,651 INFO L137 encePairwiseOnDemand]: 628/653 looper letters, 198 selfloop transitions, 124 changer transitions 0/326 dead transitions. [2022-12-13 20:28:43,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 326 transitions, 2749 flow [2022-12-13 20:28:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 20:28:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 20:28:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4722 transitions. [2022-12-13 20:28:43,658 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.28924961715160796 [2022-12-13 20:28:43,658 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4722 transitions. [2022-12-13 20:28:43,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4722 transitions. [2022-12-13 20:28:43,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:43,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4722 transitions. [2022-12-13 20:28:43,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 188.88) internal successors, (4722), 25 states have internal predecessors, (4722), 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-12-13 20:28:43,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 653.0) internal successors, (16978), 26 states have internal predecessors, (16978), 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-12-13 20:28:43,671 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 653.0) internal successors, (16978), 26 states have internal predecessors, (16978), 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-12-13 20:28:43,671 INFO L175 Difference]: Start difference. First operand has 114 places, 136 transitions, 972 flow. Second operand 25 states and 4722 transitions. [2022-12-13 20:28:43,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 326 transitions, 2749 flow [2022-12-13 20:28:43,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 326 transitions, 2630 flow, removed 55 selfloop flow, removed 2 redundant places. [2022-12-13 20:28:43,696 INFO L231 Difference]: Finished difference. Result has 148 places, 224 transitions, 2049 flow [2022-12-13 20:28:43,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2049, PETRI_PLACES=148, PETRI_TRANSITIONS=224} [2022-12-13 20:28:43,696 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 42 predicate places. [2022-12-13 20:28:43,696 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 224 transitions, 2049 flow [2022-12-13 20:28:43,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 180.44827586206895) internal successors, (5233), 29 states have internal predecessors, (5233), 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-12-13 20:28:43,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:28:43,697 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:43,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 20:28:43,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:28:43,898 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:28:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1599259313, now seen corresponding path program 1 times [2022-12-13 20:28:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:43,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929687324] [2022-12-13 20:28:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:43,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929687324] [2022-12-13 20:28:43,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929687324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:28:43,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:28:43,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:28:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547266355] [2022-12-13 20:28:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:28:43,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:28:43,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:43,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:28:43,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:28:43,989 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 653 [2022-12-13 20:28:43,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 224 transitions, 2049 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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-12-13 20:28:43,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:28:43,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 653 [2022-12-13 20:28:43,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:28:44,770 INFO L130 PetriNetUnfolder]: 1880/3757 cut-off events. [2022-12-13 20:28:44,770 INFO L131 PetriNetUnfolder]: For 50421/50421 co-relation queries the response was YES. [2022-12-13 20:28:44,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23691 conditions, 3757 events. 1880/3757 cut-off events. For 50421/50421 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 25192 event pairs, 775 based on Foata normal form. 10/3650 useless extension candidates. Maximal degree in co-relation 23649. Up to 1835 conditions per place. [2022-12-13 20:28:44,791 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 218 selfloop transitions, 5 changer transitions 0/239 dead transitions. [2022-12-13 20:28:44,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 239 transitions, 2679 flow [2022-12-13 20:28:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:28:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:28:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2022-12-13 20:28:44,793 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4512506380806534 [2022-12-13 20:28:44,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 884 transitions. [2022-12-13 20:28:44,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 884 transitions. [2022-12-13 20:28:44,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:44,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 884 transitions. [2022-12-13 20:28:44,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 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-12-13 20:28:44,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:28:44,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 653.0) internal successors, (2612), 4 states have internal predecessors, (2612), 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-12-13 20:28:44,795 INFO L175 Difference]: Start difference. First operand has 148 places, 224 transitions, 2049 flow. Second operand 3 states and 884 transitions. [2022-12-13 20:28:44,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 239 transitions, 2679 flow [2022-12-13 20:28:44,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 239 transitions, 2403 flow, removed 124 selfloop flow, removed 7 redundant places. [2022-12-13 20:28:44,836 INFO L231 Difference]: Finished difference. Result has 141 places, 222 transitions, 1775 flow [2022-12-13 20:28:44,836 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1775, PETRI_PLACES=141, PETRI_TRANSITIONS=222} [2022-12-13 20:28:44,836 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 35 predicate places. [2022-12-13 20:28:44,836 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 222 transitions, 1775 flow [2022-12-13 20:28:44,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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-12-13 20:28:44,837 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:28:44,837 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:44,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 20:28:44,837 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:28:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1597687389, now seen corresponding path program 1 times [2022-12-13 20:28:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27142024] [2022-12-13 20:28:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:45,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:45,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27142024] [2022-12-13 20:28:45,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27142024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:28:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397632531] [2022-12-13 20:28:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:28:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:28:45,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:28:45,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:28:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:45,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 20:28:45,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:28:45,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:45,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:45,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:45,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-12-13 20:28:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:45,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:28:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:46,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397632531] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:28:46,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:28:46,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 20:28:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331824768] [2022-12-13 20:28:46,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:28:46,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:28:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:46,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:28:46,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:28:51,695 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 653 [2022-12-13 20:28:51,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 222 transitions, 1775 flow. Second operand has 11 states, 11 states have (on average 274.6363636363636) internal successors, (3021), 11 states have internal predecessors, (3021), 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-12-13 20:28:51,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:28:51,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 653 [2022-12-13 20:28:51,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:28:53,644 INFO L130 PetriNetUnfolder]: 2209/4268 cut-off events. [2022-12-13 20:28:53,645 INFO L131 PetriNetUnfolder]: For 72408/72408 co-relation queries the response was YES. [2022-12-13 20:28:53,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30448 conditions, 4268 events. 2209/4268 cut-off events. For 72408/72408 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 25264 event pairs, 766 based on Foata normal form. 307/4504 useless extension candidates. Maximal degree in co-relation 30406. Up to 1853 conditions per place. [2022-12-13 20:28:53,673 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 276 selfloop transitions, 19 changer transitions 0/312 dead transitions. [2022-12-13 20:28:53,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 312 transitions, 3435 flow [2022-12-13 20:28:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:28:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:28:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2002 transitions. [2022-12-13 20:28:53,675 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43797856049004597 [2022-12-13 20:28:53,675 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2002 transitions. [2022-12-13 20:28:53,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2002 transitions. [2022-12-13 20:28:53,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:53,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2002 transitions. [2022-12-13 20:28:53,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-12-13 20:28:53,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 653.0) internal successors, (5224), 8 states have internal predecessors, (5224), 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-12-13 20:28:53,679 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 653.0) internal successors, (5224), 8 states have internal predecessors, (5224), 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-12-13 20:28:53,680 INFO L175 Difference]: Start difference. First operand has 141 places, 222 transitions, 1775 flow. Second operand 7 states and 2002 transitions. [2022-12-13 20:28:53,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 312 transitions, 3435 flow [2022-12-13 20:28:53,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 312 transitions, 3396 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 20:28:53,737 INFO L231 Difference]: Finished difference. Result has 145 places, 214 transitions, 1789 flow [2022-12-13 20:28:53,737 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1789, PETRI_PLACES=145, PETRI_TRANSITIONS=214} [2022-12-13 20:28:53,738 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 39 predicate places. [2022-12-13 20:28:53,738 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 214 transitions, 1789 flow [2022-12-13 20:28:53,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 274.6363636363636) internal successors, (3021), 11 states have internal predecessors, (3021), 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-12-13 20:28:53,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:28:53,739 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:53,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 20:28:53,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:28:53,940 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:28:53,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1286254478, now seen corresponding path program 3 times [2022-12-13 20:28:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:53,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263135683] [2022-12-13 20:28:53,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:53,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:56,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:56,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263135683] [2022-12-13 20:28:56,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263135683] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:28:56,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849409575] [2022-12-13 20:28:56,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:28:56,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:28:56,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:28:56,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:28:56,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 20:28:56,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 20:28:56,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:28:56,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-13 20:28:56,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:28:56,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:56,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:56,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-12-13 20:28:56,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:56,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:56,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:56,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-12-13 20:28:56,716 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-12-13 20:28:56,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-12-13 20:28:56,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-12-13 20:28:57,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:28:57,594 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 20:28:57,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 20:28:57,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:57,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:28:57,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2022-12-13 20:28:58,483 INFO L350 Elim1Store]: Elim1 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-12-13 20:28:58,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:58,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-13 20:28:58,847 INFO L350 Elim1Store]: Elim1 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-12-13 20:28:59,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:28:59,179 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 20:28:59,179 INFO L350 Elim1Store]: Elim1 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-12-13 20:28:59,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:28:59,477 INFO L350 Elim1Store]: Elim1 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-12-13 20:28:59,967 INFO L350 Elim1Store]: Elim1 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-12-13 20:29:00,161 INFO L350 Elim1Store]: Elim1 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-12-13 20:29:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:29:00,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:29:00,453 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_973 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:29:09,982 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:29:45,768 WARN L233 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:29:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 20:29:46,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849409575] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:29:46,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:29:46,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 39 [2022-12-13 20:29:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733658389] [2022-12-13 20:29:46,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:29:46,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 20:29:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:29:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 20:29:46,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1246, Unknown=45, NotChecked=76, Total=1640 [2022-12-13 20:29:49,207 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 20:29:49,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 214 transitions, 1789 flow. Second operand has 41 states, 41 states have (on average 180.609756097561) internal successors, (7405), 41 states have internal predecessors, (7405), 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-12-13 20:29:49,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:29:49,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 20:29:49,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:30:12,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:30:14,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:30:27,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:30:43,198 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:30:45,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:30:48,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:31:08,174 WARN L233 SmtUtils]: Spent 11.91s on a formula simplification. DAG size of input: 150 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:31:20,624 WARN L233 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:31:21,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:31:31,049 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse11 .cse0 (+ (select .cse11 .cse0) 1))))) (.cse3 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (or (not (<= 0 .cse0)) (and (forall ((v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_973 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset| 4) .cse3)))) (or (let ((.cse7 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse5 (store (store .cse1 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_965) |c_~#stored_elements~0.base| v_ArrVal_966))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse4 .cse2))) (forall ((v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_967))) (store (store .cse6 .cse7 v_ArrVal_969) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse9 (store (store .cse1 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_965) |c_~#stored_elements~0.base| v_ArrVal_966))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse8 .cse2))) (forall ((v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_973 (Array Int Int))) (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_967))) (store (store .cse10 .cse7 v_ArrVal_969) .cse2 (+ (select .cse10 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse3)))))))) (not (<= (+ 3212 |c_~#queue~0.offset|) .cse3)) (not (<= 0 .cse2)))))) is different from false [2022-12-13 20:31:39,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:31:46,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:31:48,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:31:50,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:31:56,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:31:58,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:32:01,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:32:04,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:32:05,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse20 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse19 .cse20 (+ (select .cse19 .cse20) 1)))) (.cse11 (not (<= (+ 3212 |c_~#queue~0.offset|) .cse2))) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse12 (not (<= 0 .cse1))) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse19 .cse20 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_973 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_973 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (or (and (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse5 (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_965) |c_~#stored_elements~0.base| v_ArrVal_966))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse4 .cse1))) (forall ((v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_967))) (store (store .cse6 .cse7 v_ArrVal_969) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse9 (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_965) |c_~#stored_elements~0.base| v_ArrVal_966))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse8 .cse1))) (forall ((v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_973 (Array Int Int))) (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_967))) (store (store .cse10 .cse7 v_ArrVal_969) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2))))))) .cse11 .cse12) (or .cse11 (and (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse13 (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_965) |c_~#stored_elements~0.base| v_ArrVal_966))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_973 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_967))) (store (store .cse14 .cse7 v_ArrVal_969) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse15 .cse1))))))) (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse16 (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_965) |c_~#stored_elements~0.base| v_ArrVal_966))) (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse18 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_967))) (store (store .cse17 .cse7 v_ArrVal_969) .cse1 (+ (select .cse17 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse18 .cse1)))))))) .cse12) (forall ((v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) is different from false [2022-12-13 20:32:13,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_973 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_973 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) is different from false [2022-12-13 20:32:13,955 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (or (let ((.cse4 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_965) |c_~#stored_elements~0.base| v_ArrVal_966))) (let ((.cse1 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse1 .cse0))) (forall ((v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_973 (Array Int Int))) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_967))) (store (store .cse3 .cse4 v_ArrVal_969) .cse0 (+ (select .cse3 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse5)))))) (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_965) |c_~#stored_elements~0.base| v_ArrVal_966))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse6 .cse0))) (forall ((v_ArrVal_969 Int) (v_ArrVal_967 Int) (v_ArrVal_973 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_967))) (store (store .cse8 .cse4 v_ArrVal_969) .cse0 (+ (select .cse8 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))))))) (not (<= (+ 3212 |c_~#queue~0.offset|) .cse5)) (not (<= 0 .cse0))) (forall ((v_ArrVal_973 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_973) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse5)))) is different from false [2022-12-13 20:32:29,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:32:59,850 WARN L233 SmtUtils]: Spent 17.33s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:33:07,313 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:33:12,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:33:16,910 INFO L130 PetriNetUnfolder]: 2165/4117 cut-off events. [2022-12-13 20:33:16,910 INFO L131 PetriNetUnfolder]: For 76488/76488 co-relation queries the response was YES. [2022-12-13 20:33:16,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31249 conditions, 4117 events. 2165/4117 cut-off events. For 76488/76488 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 23137 event pairs, 432 based on Foata normal form. 82/4124 useless extension candidates. Maximal degree in co-relation 31205. Up to 1888 conditions per place. [2022-12-13 20:33:16,937 INFO L137 encePairwiseOnDemand]: 633/653 looper letters, 301 selfloop transitions, 177 changer transitions 0/482 dead transitions. [2022-12-13 20:33:16,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 482 transitions, 7782 flow [2022-12-13 20:33:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 20:33:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-13 20:33:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 8598 transitions. [2022-12-13 20:33:16,945 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.28623743258539186 [2022-12-13 20:33:16,945 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 8598 transitions. [2022-12-13 20:33:16,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 8598 transitions. [2022-12-13 20:33:16,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:33:16,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 8598 transitions. [2022-12-13 20:33:16,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 186.91304347826087) internal successors, (8598), 46 states have internal predecessors, (8598), 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-12-13 20:33:16,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 653.0) internal successors, (30691), 47 states have internal predecessors, (30691), 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-12-13 20:33:16,971 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 653.0) internal successors, (30691), 47 states have internal predecessors, (30691), 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-12-13 20:33:16,971 INFO L175 Difference]: Start difference. First operand has 145 places, 214 transitions, 1789 flow. Second operand 46 states and 8598 transitions. [2022-12-13 20:33:16,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 482 transitions, 7782 flow [2022-12-13 20:33:17,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 482 transitions, 7691 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-13 20:33:17,020 INFO L231 Difference]: Finished difference. Result has 204 places, 303 transitions, 3849 flow [2022-12-13 20:33:17,020 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3849, PETRI_PLACES=204, PETRI_TRANSITIONS=303} [2022-12-13 20:33:17,020 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 98 predicate places. [2022-12-13 20:33:17,020 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 303 transitions, 3849 flow [2022-12-13 20:33:17,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 180.609756097561) internal successors, (7405), 41 states have internal predecessors, (7405), 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-12-13 20:33:17,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:33:17,021 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:33:17,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 20:33:17,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 20:33:17,223 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:33:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:33:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash -66756937, now seen corresponding path program 1 times [2022-12-13 20:33:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:33:17,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603681124] [2022-12-13 20:33:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:33:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:33:19,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:33:19,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603681124] [2022-12-13 20:33:19,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603681124] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:33:19,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300760748] [2022-12-13 20:33:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:19,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:33:19,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:33:19,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:33:19,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 20:33:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:19,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 20:33:19,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:33:19,343 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:33:19,343 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2022-12-13 20:33:20,558 INFO L350 Elim1Store]: Elim1 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-12-13 20:33:20,689 INFO L350 Elim1Store]: Elim1 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-12-13 20:33:20,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:33:20,813 INFO L350 Elim1Store]: Elim1 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-12-13 20:33:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 20:33:20,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:33:25,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:33:25,706 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 33 [2022-12-13 20:33:25,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:33:25,737 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 97 [2022-12-13 20:33:25,746 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 74 [2022-12-13 20:33:25,756 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 34 [2022-12-13 20:33:25,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:33:25,954 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2022-12-13 20:33:25,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:33:25,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:33:25,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:33:25,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-13 20:33:26,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:33:26,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 34 [2022-12-13 20:33:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 20:33:27,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300760748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:33:27,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:33:27,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 28 [2022-12-13 20:33:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501085890] [2022-12-13 20:33:27,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:33:27,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 20:33:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:33:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 20:33:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=674, Unknown=11, NotChecked=0, Total=812 [2022-12-13 20:33:52,861 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 20:33:52,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 303 transitions, 3849 flow. Second operand has 29 states, 29 states have (on average 181.6551724137931) internal successors, (5268), 29 states have internal predecessors, (5268), 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-12-13 20:33:52,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:33:52,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 20:33:52,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:34:02,627 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 63 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:34:26,449 INFO L130 PetriNetUnfolder]: 2161/4086 cut-off events. [2022-12-13 20:34:26,449 INFO L131 PetriNetUnfolder]: For 279214/279250 co-relation queries the response was YES. [2022-12-13 20:34:26,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48936 conditions, 4086 events. 2161/4086 cut-off events. For 279214/279250 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 22935 event pairs, 1159 based on Foata normal form. 2/4012 useless extension candidates. Maximal degree in co-relation 48876. Up to 3822 conditions per place. [2022-12-13 20:34:26,483 INFO L137 encePairwiseOnDemand]: 641/653 looper letters, 305 selfloop transitions, 56 changer transitions 0/365 dead transitions. [2022-12-13 20:34:26,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 365 transitions, 5269 flow [2022-12-13 20:34:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 20:34:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 20:34:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3888 transitions. [2022-12-13 20:34:26,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2835265806169328 [2022-12-13 20:34:26,488 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3888 transitions. [2022-12-13 20:34:26,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3888 transitions. [2022-12-13 20:34:26,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:34:26,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3888 transitions. [2022-12-13 20:34:26,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 185.14285714285714) internal successors, (3888), 21 states have internal predecessors, (3888), 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-12-13 20:34:26,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 653.0) internal successors, (14366), 22 states have internal predecessors, (14366), 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-12-13 20:34:26,498 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 653.0) internal successors, (14366), 22 states have internal predecessors, (14366), 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-12-13 20:34:26,499 INFO L175 Difference]: Start difference. First operand has 204 places, 303 transitions, 3849 flow. Second operand 21 states and 3888 transitions. [2022-12-13 20:34:26,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 365 transitions, 5269 flow [2022-12-13 20:34:26,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 365 transitions, 4037 flow, removed 598 selfloop flow, removed 6 redundant places. [2022-12-13 20:34:26,680 INFO L231 Difference]: Finished difference. Result has 228 places, 322 transitions, 3115 flow [2022-12-13 20:34:26,680 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=2695, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3115, PETRI_PLACES=228, PETRI_TRANSITIONS=322} [2022-12-13 20:34:26,681 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 122 predicate places. [2022-12-13 20:34:26,681 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 322 transitions, 3115 flow [2022-12-13 20:34:26,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 181.6551724137931) internal successors, (5268), 29 states have internal predecessors, (5268), 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-12-13 20:34:26,681 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:34:26,681 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-12-13 20:34:26,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 20:34:26,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 20:34:26,883 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 20:34:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 611774702, now seen corresponding path program 4 times [2022-12-13 20:34:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:26,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435902316] [2022-12-13 20:34:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:34:30,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435902316] [2022-12-13 20:34:30,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435902316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:34:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434377164] [2022-12-13 20:34:30,562 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:34:30,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:34:30,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:34:30,564 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:34:30,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9bef804-4f15-424a-992c-347ebcbed2fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 20:34:30,701 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:34:30,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:34:30,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-13 20:34:30,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:34:30,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:34:30,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:34:30,793 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:34:30,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-13 20:34:30,863 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:34:30,863 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2022-12-13 20:34:31,348 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-13 20:34:31,881 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 42 treesize of output 37 [2022-12-13 20:34:32,552 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 48 [2022-12-13 20:34:32,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:34:32,808 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 76 [2022-12-13 20:34:33,217 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 92 treesize of output 85 [2022-12-13 20:34:33,719 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 88 treesize of output 83 [2022-12-13 20:34:34,544 INFO L350 Elim1Store]: Elim1 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 96 treesize of output 89 [2022-12-13 20:34:34,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:34:34,910 INFO L350 Elim1Store]: Elim1 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 161 treesize of output 163 [2022-12-13 20:34:35,408 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 179 treesize of output 172 [2022-12-13 20:34:36,177 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 175 treesize of output 170 [2022-12-13 20:34:38,925 INFO L350 Elim1Store]: Elim1 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 173 treesize of output 175 [2022-12-13 20:34:42,345 INFO L350 Elim1Store]: Elim1 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 188 treesize of output 181 [2022-12-13 20:34:42,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:34:42,764 INFO L350 Elim1Store]: Elim1 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 340 treesize of output 342 [2022-12-13 20:34:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:34:43,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:34:43,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1228 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1228 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-13 20:34:43,393 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1228 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1228 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:34:43,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1228 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1228 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-13 20:34:43,485 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2022-12-13 20:34:43,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1223 Int)) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1223 Int)) (<= (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 20:34:43,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse6) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse8 .cse2 (+ (select .cse8 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse6) 4)))))) is different from false [2022-12-13 20:34:45,637 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse3)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| .cse0)) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ (* (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| .cse0)) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))))) is different from false [2022-12-13 20:34:45,685 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 .cse1))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ (* (select (select (store (let ((.cse2 (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ (* (select (select (store (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse9 .cse1))))))))) is different from false [2022-12-13 20:34:45,756 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (let ((.cse3 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ (* (select (select (store (let ((.cse0 (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse4 .cse2))))))) (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (let ((.cse9 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ (* (select (select (store (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 .cse2 (+ (select .cse8 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse10 .cse2))))))))) is different from false [2022-12-13 20:34:45,825 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (let ((.cse3 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse2) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse4 .cse2))))))) (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (let ((.cse9 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 .cse2 (+ (select .cse8 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse10 .cse2))))))))) is different from false [2022-12-13 20:34:45,932 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (+ (select .cse6 .cse8) 1))) (and (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1216 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1216) .cse8 .cse9)) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 .cse1))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ (* (select (select (store (let ((.cse2 (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1216 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1216) .cse8 .cse9)) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse10 .cse1))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ (* (select (select (store (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (store (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 .cse1 (+ (select .cse12 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2022-12-13 20:34:46,046 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1214 Int) (v_ArrVal_1216 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse9 .cse10 v_ArrVal_1214))) (store (store .cse6 .cse7 v_ArrVal_1216) .cse8 (+ (select .cse6 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse2) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse4 .cse2))))))) (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1214 Int) (v_ArrVal_1216 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse15 (store .cse9 .cse10 v_ArrVal_1214))) (store (store .cse15 .cse7 v_ArrVal_1216) .cse8 (+ (select .cse15 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 .cse2 (+ (select .cse12 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse14 .cse2))))))))) is different from false [2022-12-13 20:35:19,088 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:35:19,155 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1213 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1213))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1214 Int) (v_ArrVal_1216 Int)) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1214))) (store (store .cse7 .cse5 v_ArrVal_1216) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 .cse1))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ (* (select (select (store (let ((.cse2 (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse8 .cse1))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1213 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1213))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1214 Int) (v_ArrVal_1216 Int)) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1214))) (store (store .cse14 .cse5 v_ArrVal_1216) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse9 .cse1))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ (* (select (select (store (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 .cse1 (+ (select .cse11 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse15 .cse1))))))))) is different from false [2022-12-13 20:35:19,246 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1213 (Array Int Int))) (let ((.cse7 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1213))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse0 .cse1))) (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1214 Int) (v_ArrVal_1216 Int)) (let ((.cse5 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1214))) (store (store .cse8 .cse6 v_ArrVal_1216) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse2 .cse1))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ (* (select (select (store (let ((.cse3 (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse6 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1213 (Array Int Int))) (let ((.cse15 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1213))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse10 .cse1))) (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1214 Int) (v_ArrVal_1216 Int)) (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1214))) (store (store .cse16 .cse6 v_ArrVal_1216) .cse1 (+ (select .cse16 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ (* (select (select (store (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse6 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 .cse1 (+ (select .cse12 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse14 .cse1))))))))))))) is different from false [2022-12-13 20:35:19,337 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse18 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1)))))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1213 (Array Int Int))) (let ((.cse6 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1213))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1214 Int) (v_ArrVal_1216 Int)) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1214))) (store (store .cse7 .cse5 v_ArrVal_1216) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= (+ (* (select (select (store (let ((.cse0 (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse4 .cse2))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse8 .cse2))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1213 (Array Int Int))) (let ((.cse15 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1213))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse10 .cse2))) (forall ((v_ArrVal_1220 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1214 Int) (v_ArrVal_1216 Int)) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1214))) (store (store .cse16 .cse5 v_ArrVal_1216) .cse2 (+ (select .cse16 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1220))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse11 .cse2))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1223 Int)) (<= 0 (+ (* (select (select (store (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_1221) .cse5 v_ArrVal_1223)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1225))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 .cse2 (+ (select .cse13 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1228) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))))))))))))) is different from false [2022-12-13 20:35:22,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:35:22,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1947 treesize of output 1951 [2022-12-13 20:35:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 24 not checked. [2022-12-13 20:35:33,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434377164] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:35:33,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:35:33,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 21] total 55 [2022-12-13 20:35:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703177608] [2022-12-13 20:35:33,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:35:33,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-13 20:35:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:35:33,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-13 20:35:33,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1487, Unknown=47, NotChecked=1410, Total=3192 [2022-12-13 20:35:36,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:38,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:40,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:41,184 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 20:35:41,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 322 transitions, 3115 flow. Second operand has 57 states, 57 states have (on average 180.57894736842104) internal successors, (10293), 57 states have internal predecessors, (10293), 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-12-13 20:35:41,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:35:41,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 20:35:41,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:35:46,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:48,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:35:50,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:52,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:54,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:56,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:35:58,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:36:00,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:36:02,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]