./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok.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_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/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_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/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_388f51de-90a0-4e0f-b271-f270743863b2/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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- 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 21:07:48,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:07:48,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:07:48,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:07:48,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:07:48,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:07:48,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:07:48,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:07:48,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:07:48,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:07:48,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:07:48,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:07:48,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:07:48,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:07:48,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:07:48,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:07:48,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:07:48,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:07:48,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:07:48,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:07:48,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:07:48,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:07:48,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:07:48,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:07:48,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:07:48,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:07:48,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:07:48,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:07:48,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:07:48,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:07:48,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:07:48,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:07:48,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:07:48,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:07:48,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:07:48,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:07:48,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:07:48,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:07:48,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:07:48,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:07:48,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:07:48,913 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 21:07:48,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:07:48,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:07:48,935 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:07:48,935 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:07:48,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:07:48,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:07:48,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:07:48,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:07:48,937 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:07:48,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:07:48,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:07:48,937 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:07:48,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:07:48,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:07:48,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:07:48,938 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 21:07:48,938 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 21:07:48,938 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 21:07:48,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:07:48,938 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:07:48,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:07:48,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:07:48,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:07:48,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:07:48,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:07:48,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:07:48,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:07:48,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:07:48,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:07:48,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:07:48,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:07:48,940 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:07:48,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:07:48,941 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:07:48,941 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_388f51de-90a0-4e0f-b271-f270743863b2/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_388f51de-90a0-4e0f-b271-f270743863b2/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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-12-13 21:07:49,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:07:49,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:07:49,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:07:49,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:07:49,156 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:07:49,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread/queue_ok.i [2022-12-13 21:07:51,723 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:07:51,894 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:07:51,895 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/sv-benchmarks/c/pthread/queue_ok.i [2022-12-13 21:07:51,906 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/data/a0258c00e/d05241f5adf54c4ebfa73b8f04a89094/FLAG819a4d6ea [2022-12-13 21:07:51,917 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/data/a0258c00e/d05241f5adf54c4ebfa73b8f04a89094 [2022-12-13 21:07:51,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:07:51,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:07:51,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:07:51,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:07:51,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:07:51,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:07:51" (1/1) ... [2022-12-13 21:07:51,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446fd4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:51, skipping insertion in model container [2022-12-13 21:07:51,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:07:51" (1/1) ... [2022-12-13 21:07:51,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:07:51,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:07:52,226 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_388f51de-90a0-4e0f-b271-f270743863b2/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-12-13 21:07:52,229 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_388f51de-90a0-4e0f-b271-f270743863b2/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-12-13 21:07:52,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:07:52,241 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:07:52,274 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_388f51de-90a0-4e0f-b271-f270743863b2/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-12-13 21:07:52,276 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_388f51de-90a0-4e0f-b271-f270743863b2/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-12-13 21:07:52,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:07:52,313 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:07:52,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52 WrapperNode [2022-12-13 21:07:52,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:07:52,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:07:52,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:07:52,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:07:52,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,352 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-13 21:07:52,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:07:52,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:07:52,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:07:52,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:07:52,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,374 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:07:52,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:07:52,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:07:52,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:07:52,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (1/1) ... [2022-12-13 21:07:52,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:07:52,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:07:52,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:07:52,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:07:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 21:07:52,458 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 21:07:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 21:07:52,458 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 21:07:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:07:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:07:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:07:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:07:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 21:07:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:07:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:07:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:07:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:07:52,460 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 21:07:52,589 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:07:52,591 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:07:52,942 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:07:52,948 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:07:52,948 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 21:07:52,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:07:52 BoogieIcfgContainer [2022-12-13 21:07:52,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:07:52,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:07:52,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:07:52,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:07:52,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:07:51" (1/3) ... [2022-12-13 21:07:52,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a4a2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:07:52, skipping insertion in model container [2022-12-13 21:07:52,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:52" (2/3) ... [2022-12-13 21:07:52,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a4a2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:07:52, skipping insertion in model container [2022-12-13 21:07:52,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:07:52" (3/3) ... [2022-12-13 21:07:52,956 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-12-13 21:07:52,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:07:52,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-12-13 21:07:52,970 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:07:53,055 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 21:07:53,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-12-13 21:07:53,161 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-12-13 21:07:53,161 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 21:07:53,167 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 21:07:53,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 285 places, 291 transitions, 598 flow [2022-12-13 21:07:53,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 284 transitions, 580 flow [2022-12-13 21:07:53,177 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:07:53,185 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 284 transitions, 580 flow [2022-12-13 21:07:53,187 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 284 transitions, 580 flow [2022-12-13 21:07:53,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 284 transitions, 580 flow [2022-12-13 21:07:53,235 INFO L130 PetriNetUnfolder]: 13/284 cut-off events. [2022-12-13 21:07:53,235 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 21:07:53,236 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 21:07:53,243 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-12-13 21:08:06,171 INFO L134 LiptonReduction]: Checked pairs total: 54635 [2022-12-13 21:08:06,171 INFO L136 LiptonReduction]: Total number of compositions: 362 [2022-12-13 21:08:06,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:08:06,190 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;@30505f2a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:08:06,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-12-13 21:08:06,193 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 21:08:06,193 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:08:06,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:06,193 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 21:08:06,194 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 21:08:06,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:06,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1211, now seen corresponding path program 1 times [2022-12-13 21:08:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:06,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467768255] [2022-12-13 21:08:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:06,290 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 21:08:06,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:06,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467768255] [2022-12-13 21:08:06,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467768255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:06,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:06,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 21:08:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618610191] [2022-12-13 21:08:06,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:06,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:08:06,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:06,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:08:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:08:06,320 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 653 [2022-12-13 21:08:06,332 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 21:08:06,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:06,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 653 [2022-12-13 21:08:06,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:06,906 INFO L130 PetriNetUnfolder]: 4154/6551 cut-off events. [2022-12-13 21:08:06,906 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-13 21:08:06,912 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 21:08:06,935 INFO L137 encePairwiseOnDemand]: 617/653 looper letters, 64 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2022-12-13 21:08:06,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 280 flow [2022-12-13 21:08:06,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:08:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 21:08:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 660 transitions. [2022-12-13 21:08:06,948 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5053598774885145 [2022-12-13 21:08:06,949 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 660 transitions. [2022-12-13 21:08:06,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 660 transitions. [2022-12-13 21:08:06,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:06,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 660 transitions. [2022-12-13 21:08:06,958 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 21:08:06,965 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 21:08:06,966 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 21:08:06,967 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 660 transitions. [2022-12-13 21:08:06,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 280 flow [2022-12-13 21:08:06,971 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 21:08:06,972 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2022-12-13 21:08:06,974 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 21:08:06,977 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2022-12-13 21:08:06,977 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2022-12-13 21:08:06,978 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 21:08:06,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:06,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:08:06,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:08:06,978 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 21:08:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1184368, now seen corresponding path program 1 times [2022-12-13 21:08:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:06,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478237722] [2022-12-13 21:08:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:07,143 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 21:08:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:07,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478237722] [2022-12-13 21:08:07,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478237722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:07,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:07,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:08:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246291609] [2022-12-13 21:08:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:07,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:07,236 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 653 [2022-12-13 21:08:07,237 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 21:08:07,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:07,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 653 [2022-12-13 21:08:07,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:07,787 INFO L130 PetriNetUnfolder]: 4104/6453 cut-off events. [2022-12-13 21:08:07,787 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 21:08:07,793 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 21:08:07,836 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 60 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2022-12-13 21:08:07,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 264 flow [2022-12-13 21:08:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2022-12-13 21:08:07,838 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4476773864216437 [2022-12-13 21:08:07,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 877 transitions. [2022-12-13 21:08:07,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 877 transitions. [2022-12-13 21:08:07,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:07,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 877 transitions. [2022-12-13 21:08:07,840 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 21:08:07,847 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 21:08:07,850 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 21:08:07,850 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 877 transitions. [2022-12-13 21:08:07,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 264 flow [2022-12-13 21:08:07,851 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 21:08:07,853 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2022-12-13 21:08:07,853 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 21:08:07,854 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2022-12-13 21:08:07,854 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2022-12-13 21:08:07,855 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 21:08:07,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:07,855 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:08:07,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:08:07,856 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 21:08:07,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:07,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1184369, now seen corresponding path program 1 times [2022-12-13 21:08:07,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642032667] [2022-12-13 21:08:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:07,977 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 21:08:07,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:07,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642032667] [2022-12-13 21:08:07,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642032667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:07,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:07,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:08:07,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492246612] [2022-12-13 21:08:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:07,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:07,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:07,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:07,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:08,084 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 653 [2022-12-13 21:08:08,085 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 21:08:08,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:08,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 653 [2022-12-13 21:08:08,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:08,566 INFO L130 PetriNetUnfolder]: 4054/6355 cut-off events. [2022-12-13 21:08:08,566 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 21:08:08,569 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 21:08:08,586 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 58 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2022-12-13 21:08:08,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 260 flow [2022-12-13 21:08:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2022-12-13 21:08:08,588 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45278203164880043 [2022-12-13 21:08:08,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2022-12-13 21:08:08,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2022-12-13 21:08:08,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:08,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2022-12-13 21:08:08,590 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 21:08:08,592 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 21:08:08,593 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 21:08:08,593 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 887 transitions. [2022-12-13 21:08:08,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 260 flow [2022-12-13 21:08:08,593 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 21:08:08,594 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2022-12-13 21:08:08,594 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 21:08:08,594 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2022-12-13 21:08:08,595 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2022-12-13 21:08:08,595 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 21:08:08,595 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:08,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:08:08,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:08:08,595 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 21:08:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1138163353, now seen corresponding path program 1 times [2022-12-13 21:08:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:08,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711628297] [2022-12-13 21:08:08,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:08,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:08,728 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 21:08:08,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:08,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711628297] [2022-12-13 21:08:08,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711628297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:08,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:08,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:08:08,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972935923] [2022-12-13 21:08:08,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:08,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:08,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:08,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:08,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:08,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 653 [2022-12-13 21:08:08,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 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 21:08:08,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:08,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 653 [2022-12-13 21:08:08,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:09,273 INFO L130 PetriNetUnfolder]: 3441/5394 cut-off events. [2022-12-13 21:08:09,273 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 21:08:09,277 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 21:08:09,292 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 55 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2022-12-13 21:08:09,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 244 flow [2022-12-13 21:08:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2022-12-13 21:08:09,295 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4548238897396631 [2022-12-13 21:08:09,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2022-12-13 21:08:09,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2022-12-13 21:08:09,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:09,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2022-12-13 21:08:09,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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 21:08:09,302 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 21:08:09,303 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 21:08:09,304 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 891 transitions. [2022-12-13 21:08:09,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 244 flow [2022-12-13 21:08:09,304 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 21:08:09,305 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 130 flow [2022-12-13 21:08:09,306 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 21:08:09,306 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2022-12-13 21:08:09,306 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 130 flow [2022-12-13 21:08:09,307 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 21:08:09,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:09,307 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:08:09,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:08:09,308 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 21:08:09,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1138163355, now seen corresponding path program 1 times [2022-12-13 21:08:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:09,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673593057] [2022-12-13 21:08:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:09,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:09,378 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 21:08:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:09,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673593057] [2022-12-13 21:08:09,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673593057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:09,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:09,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:08:09,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13474605] [2022-12-13 21:08:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:09,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:09,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:09,475 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 653 [2022-12-13 21:08:09,476 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 21:08:09,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:09,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 653 [2022-12-13 21:08:09,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:09,827 INFO L130 PetriNetUnfolder]: 3002/4705 cut-off events. [2022-12-13 21:08:09,827 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 21:08:09,829 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 21:08:09,838 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 51 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-12-13 21:08:09,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 230 flow [2022-12-13 21:08:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2022-12-13 21:08:09,840 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45278203164880043 [2022-12-13 21:08:09,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2022-12-13 21:08:09,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2022-12-13 21:08:09,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:09,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2022-12-13 21:08:09,841 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 21:08:09,844 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 21:08:09,844 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 21:08:09,845 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 130 flow. Second operand 3 states and 887 transitions. [2022-12-13 21:08:09,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 230 flow [2022-12-13 21:08:09,845 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 21:08:09,846 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 127 flow [2022-12-13 21:08:09,846 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 21:08:09,847 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2022-12-13 21:08:09,847 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 127 flow [2022-12-13 21:08:09,847 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 21:08:09,848 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:09,848 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:08:09,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:08:09,848 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 21:08:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1138163351, now seen corresponding path program 1 times [2022-12-13 21:08:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:09,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001999221] [2022-12-13 21:08:09,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:10,782 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 21:08:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001999221] [2022-12-13 21:08:10,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001999221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:10,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:10,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:08:10,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139078311] [2022-12-13 21:08:10,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:10,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:10,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:10,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:11,634 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 653 [2022-12-13 21:08:11,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 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 21:08:11,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:11,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 653 [2022-12-13 21:08:11,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:12,139 INFO L130 PetriNetUnfolder]: 3166/4953 cut-off events. [2022-12-13 21:08:12,139 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 21:08:12,142 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 21:08:12,150 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 59 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2022-12-13 21:08:12,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 271 flow [2022-12-13 21:08:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2022-12-13 21:08:12,152 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44155181214905564 [2022-12-13 21:08:12,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 865 transitions. [2022-12-13 21:08:12,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 865 transitions. [2022-12-13 21:08:12,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:12,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 865 transitions. [2022-12-13 21:08:12,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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 21:08:12,155 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 21:08:12,156 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 21:08:12,156 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 3 states and 865 transitions. [2022-12-13 21:08:12,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 271 flow [2022-12-13 21:08:12,156 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 21:08:12,157 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 149 flow [2022-12-13 21:08:12,157 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 21:08:12,158 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -46 predicate places. [2022-12-13 21:08:12,158 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 149 flow [2022-12-13 21:08:12,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 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 21:08:12,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:12,158 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:08:12,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:08:12,159 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 21:08:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1138205808, now seen corresponding path program 1 times [2022-12-13 21:08:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:12,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045861430] [2022-12-13 21:08:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:12,208 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 21:08:12,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:12,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045861430] [2022-12-13 21:08:12,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045861430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:12,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:12,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:08:12,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355552004] [2022-12-13 21:08:12,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:12,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:12,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:12,315 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 653 [2022-12-13 21:08:12,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 276.6666666666667) internal successors, (830), 3 states have internal predecessors, (830), 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 21:08:12,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:12,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 653 [2022-12-13 21:08:12,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:12,581 INFO L130 PetriNetUnfolder]: 2185/3487 cut-off events. [2022-12-13 21:08:12,581 INFO L131 PetriNetUnfolder]: For 164/223 co-relation queries the response was YES. [2022-12-13 21:08:12,583 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 21:08:12,589 INFO L137 encePairwiseOnDemand]: 650/653 looper letters, 52 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-12-13 21:08:12,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 255 flow [2022-12-13 21:08:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2022-12-13 21:08:12,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44818785094435937 [2022-12-13 21:08:12,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 878 transitions. [2022-12-13 21:08:12,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 878 transitions. [2022-12-13 21:08:12,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:12,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 878 transitions. [2022-12-13 21:08:12,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.6666666666667) internal successors, (878), 3 states have internal predecessors, (878), 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 21:08:12,593 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 21:08:12,594 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 21:08:12,594 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 149 flow. Second operand 3 states and 878 transitions. [2022-12-13 21:08:12,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 255 flow [2022-12-13 21:08:12,594 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 21:08:12,595 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 147 flow [2022-12-13 21:08:12,595 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 21:08:12,595 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -46 predicate places. [2022-12-13 21:08:12,596 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 147 flow [2022-12-13 21:08:12,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.6666666666667) internal successors, (830), 3 states have internal predecessors, (830), 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 21:08:12,596 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:12,596 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:08:12,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:08:12,596 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 21:08:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:12,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1138205807, now seen corresponding path program 1 times [2022-12-13 21:08:12,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:12,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034658276] [2022-12-13 21:08:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:12,642 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 21:08:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:12,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034658276] [2022-12-13 21:08:12,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034658276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:12,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:12,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081513898] [2022-12-13 21:08:12,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:12,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:08:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:12,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:08:12,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:08:12,795 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 653 [2022-12-13 21:08:12,796 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 21:08:12,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:12,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 653 [2022-12-13 21:08:12,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:13,046 INFO L130 PetriNetUnfolder]: 1362/2261 cut-off events. [2022-12-13 21:08:13,046 INFO L131 PetriNetUnfolder]: For 122/161 co-relation queries the response was YES. [2022-12-13 21:08:13,048 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 21:08:13,052 INFO L137 encePairwiseOnDemand]: 650/653 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2022-12-13 21:08:13,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 251 flow [2022-12-13 21:08:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2022-12-13 21:08:13,057 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43542623787646756 [2022-12-13 21:08:13,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 853 transitions. [2022-12-13 21:08:13,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 853 transitions. [2022-12-13 21:08:13,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:13,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 853 transitions. [2022-12-13 21:08:13,059 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 21:08:13,061 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 21:08:13,061 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 21:08:13,062 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 147 flow. Second operand 3 states and 853 transitions. [2022-12-13 21:08:13,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 251 flow [2022-12-13 21:08:13,062 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 21:08:13,063 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 145 flow [2022-12-13 21:08:13,063 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 21:08:13,064 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2022-12-13 21:08:13,064 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 145 flow [2022-12-13 21:08:13,064 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 21:08:13,064 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:13,064 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 21:08:13,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:08:13,065 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 21:08:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash 923369062, now seen corresponding path program 1 times [2022-12-13 21:08:13,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:13,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552931961] [2022-12-13 21:08:13,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:13,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:13,642 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 21:08:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:13,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552931961] [2022-12-13 21:08:13,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552931961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:13,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:13,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445241228] [2022-12-13 21:08:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:13,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:08:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:08:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:08:14,409 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 653 [2022-12-13 21:08:14,410 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 21:08:14,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:14,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 653 [2022-12-13 21:08:14,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:15,027 INFO L130 PetriNetUnfolder]: 1755/2887 cut-off events. [2022-12-13 21:08:15,027 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-13 21:08:15,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5907 conditions, 2887 events. 1755/2887 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14986 event pairs, 425 based on Foata normal form. 25/2038 useless extension candidates. Maximal degree in co-relation 5902. Up to 2306 conditions per place. [2022-12-13 21:08:15,035 INFO L137 encePairwiseOnDemand]: 646/653 looper letters, 75 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2022-12-13 21:08:15,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 376 flow [2022-12-13 21:08:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:08:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:08:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1142 transitions. [2022-12-13 21:08:15,038 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43721286370597245 [2022-12-13 21:08:15,038 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1142 transitions. [2022-12-13 21:08:15,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1142 transitions. [2022-12-13 21:08:15,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:15,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1142 transitions. [2022-12-13 21:08:15,041 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 21:08:15,044 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 21:08:15,045 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 21:08:15,045 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 145 flow. Second operand 4 states and 1142 transitions. [2022-12-13 21:08:15,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 376 flow [2022-12-13 21:08:15,046 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 21:08:15,047 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 191 flow [2022-12-13 21:08:15,047 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=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2022-12-13 21:08:15,048 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2022-12-13 21:08:15,048 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 191 flow [2022-12-13 21:08:15,049 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 21:08:15,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:15,049 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 21:08:15,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:08:15,049 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 21:08:15,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash 923326521, now seen corresponding path program 1 times [2022-12-13 21:08:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:15,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107925665] [2022-12-13 21:08:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:15,153 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 21:08:15,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:15,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107925665] [2022-12-13 21:08:15,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107925665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:15,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:15,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171482653] [2022-12-13 21:08:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:15,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:08:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:08:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:08:15,329 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 653 [2022-12-13 21:08:15,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 191 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 21:08:15,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:15,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 653 [2022-12-13 21:08:15,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:15,677 INFO L130 PetriNetUnfolder]: 1781/3025 cut-off events. [2022-12-13 21:08:15,677 INFO L131 PetriNetUnfolder]: For 426/426 co-relation queries the response was YES. [2022-12-13 21:08:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6377 conditions, 3025 events. 1781/3025 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 16381 event pairs, 753 based on Foata normal form. 70/2281 useless extension candidates. Maximal degree in co-relation 6371. Up to 1775 conditions per place. [2022-12-13 21:08:15,685 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 86 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2022-12-13 21:08:15,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 440 flow [2022-12-13 21:08:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:08:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:08:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1157 transitions. [2022-12-13 21:08:15,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44295558958652376 [2022-12-13 21:08:15,690 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1157 transitions. [2022-12-13 21:08:15,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1157 transitions. [2022-12-13 21:08:15,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:15,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1157 transitions. [2022-12-13 21:08:15,692 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 21:08:15,694 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 21:08:15,694 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 21:08:15,694 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 191 flow. Second operand 4 states and 1157 transitions. [2022-12-13 21:08:15,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 440 flow [2022-12-13 21:08:15,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 97 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:08:15,696 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 185 flow [2022-12-13 21:08:15,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2022-12-13 21:08:15,697 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2022-12-13 21:08:15,697 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 185 flow [2022-12-13 21:08:15,697 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 21:08:15,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:15,697 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:08:15,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:08:15,697 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 21:08:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1864464397, now seen corresponding path program 1 times [2022-12-13 21:08:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:15,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534817617] [2022-12-13 21:08:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:15,732 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 21:08:15,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:15,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534817617] [2022-12-13 21:08:15,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534817617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:15,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:15,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:15,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287515298] [2022-12-13 21:08:15,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:15,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:15,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:15,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:15,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:15,740 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 653 [2022-12-13 21:08:15,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 185 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 21:08:15,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:15,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 653 [2022-12-13 21:08:15,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:15,890 INFO L130 PetriNetUnfolder]: 620/1223 cut-off events. [2022-12-13 21:08:15,890 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-13 21:08:15,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 1223 events. 620/1223 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6197 event pairs, 387 based on Foata normal form. 0/1026 useless extension candidates. Maximal degree in co-relation 2548. Up to 637 conditions per place. [2022-12-13 21:08:15,893 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 65 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2022-12-13 21:08:15,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 350 flow [2022-12-13 21:08:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2022-12-13 21:08:15,895 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45278203164880043 [2022-12-13 21:08:15,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2022-12-13 21:08:15,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2022-12-13 21:08:15,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:15,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2022-12-13 21:08:15,897 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 21:08:15,898 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 21:08:15,899 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 21:08:15,899 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 185 flow. Second operand 3 states and 887 transitions. [2022-12-13 21:08:15,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 350 flow [2022-12-13 21:08:15,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 75 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:08:15,901 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 186 flow [2022-12-13 21:08:15,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2022-12-13 21:08:15,901 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2022-12-13 21:08:15,901 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 186 flow [2022-12-13 21:08:15,901 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 21:08:15,901 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:15,902 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:08:15,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:08:15,902 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 21:08:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash 180931921, now seen corresponding path program 1 times [2022-12-13 21:08:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:15,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673571177] [2022-12-13 21:08:15,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:16,006 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 21:08:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:16,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673571177] [2022-12-13 21:08:16,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673571177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:16,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:16,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220152400] [2022-12-13 21:08:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:16,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:08:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:16,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:08:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:08:16,166 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 653 [2022-12-13 21:08:16,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 186 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 21:08:16,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:16,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 653 [2022-12-13 21:08:16,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:16,320 INFO L130 PetriNetUnfolder]: 473/934 cut-off events. [2022-12-13 21:08:16,320 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-13 21:08:16,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2014 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 4375 event pairs, 302 based on Foata normal form. 10/835 useless extension candidates. Maximal degree in co-relation 2006. Up to 655 conditions per place. [2022-12-13 21:08:16,322 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 65 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2022-12-13 21:08:16,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 351 flow [2022-12-13 21:08:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:08:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:08:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1163 transitions. [2022-12-13 21:08:16,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44525267993874423 [2022-12-13 21:08:16,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1163 transitions. [2022-12-13 21:08:16,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1163 transitions. [2022-12-13 21:08:16,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:16,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1163 transitions. [2022-12-13 21:08:16,329 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 21:08:16,331 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 21:08:16,331 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 21:08:16,331 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 186 flow. Second operand 4 states and 1163 transitions. [2022-12-13 21:08:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 351 flow [2022-12-13 21:08:16,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 341 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 21:08:16,333 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 184 flow [2022-12-13 21:08:16,333 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 21:08:16,333 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2022-12-13 21:08:16,334 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 184 flow [2022-12-13 21:08:16,334 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 21:08:16,334 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:16,334 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:08:16,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:08:16,334 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 21:08:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 180931920, now seen corresponding path program 1 times [2022-12-13 21:08:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:16,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013837422] [2022-12-13 21:08:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:16,425 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 21:08:16,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013837422] [2022-12-13 21:08:16,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013837422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:16,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:16,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:08:16,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601425473] [2022-12-13 21:08:16,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:16,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:16,514 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 653 [2022-12-13 21:08:16,515 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 21:08:16,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:16,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 653 [2022-12-13 21:08:16,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:16,618 INFO L130 PetriNetUnfolder]: 443/875 cut-off events. [2022-12-13 21:08:16,618 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-13 21:08:16,619 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 3981 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 21:08:16,620 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 48 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-13 21:08:16,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 282 flow [2022-12-13 21:08:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:08:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2022-12-13 21:08:16,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44308320571720267 [2022-12-13 21:08:16,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 868 transitions. [2022-12-13 21:08:16,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 868 transitions. [2022-12-13 21:08:16,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:16,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 868 transitions. [2022-12-13 21:08:16,623 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 21:08:16,624 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 21:08:16,625 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 21:08:16,625 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 184 flow. Second operand 3 states and 868 transitions. [2022-12-13 21:08:16,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 282 flow [2022-12-13 21:08:16,626 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 21:08:16,627 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 182 flow [2022-12-13 21:08:16,627 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 21:08:16,628 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2022-12-13 21:08:16,628 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 182 flow [2022-12-13 21:08:16,628 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 21:08:16,628 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:16,628 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:08:16,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:08:16,629 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 21:08:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1313925938, now seen corresponding path program 1 times [2022-12-13 21:08:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:16,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54468618] [2022-12-13 21:08:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:17,035 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 21:08:17,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:17,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54468618] [2022-12-13 21:08:17,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54468618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:17,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:17,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:08:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824096272] [2022-12-13 21:08:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:17,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:08:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:17,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:08:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:08:17,254 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 653 [2022-12-13 21:08:17,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 267.4) internal successors, (1337), 5 states have internal predecessors, (1337), 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 21:08:17,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:17,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 653 [2022-12-13 21:08:17,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:17,456 INFO L130 PetriNetUnfolder]: 463/898 cut-off events. [2022-12-13 21:08:17,456 INFO L131 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2022-12-13 21:08:17,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 898 events. 463/898 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4034 event pairs, 368 based on Foata normal form. 0/825 useless extension candidates. Maximal degree in co-relation 1975. Up to 836 conditions per place. [2022-12-13 21:08:17,459 INFO L137 encePairwiseOnDemand]: 646/653 looper letters, 58 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2022-12-13 21:08:17,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 353 flow [2022-12-13 21:08:17,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:08:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:08:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1654 transitions. [2022-12-13 21:08:17,461 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4221541602858601 [2022-12-13 21:08:17,461 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1654 transitions. [2022-12-13 21:08:17,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1654 transitions. [2022-12-13 21:08:17,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:17,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1654 transitions. [2022-12-13 21:08:17,463 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 21:08:17,466 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 21:08:17,467 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 21:08:17,467 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 182 flow. Second operand 6 states and 1654 transitions. [2022-12-13 21:08:17,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 353 flow [2022-12-13 21:08:17,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:08:17,468 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 234 flow [2022-12-13 21:08:17,468 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2022-12-13 21:08:17,469 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -36 predicate places. [2022-12-13 21:08:17,469 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 234 flow [2022-12-13 21:08:17,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 267.4) internal successors, (1337), 5 states have internal predecessors, (1337), 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 21:08:17,469 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:17,469 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:08:17,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:08:17,469 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 21:08:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1917087459, now seen corresponding path program 1 times [2022-12-13 21:08:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:17,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404227466] [2022-12-13 21:08:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:17,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:17,703 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 21:08:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:17,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404227466] [2022-12-13 21:08:17,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404227466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:08:17,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410889527] [2022-12-13 21:08:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:17,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:08:17,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:08:17,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:08:17,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:08:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:17,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 21:08:17,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:17,964 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 21:08:18,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:08:18,002 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 21:08:18,018 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 21:08:18,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:08:18,052 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_450 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_450) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_450 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_450) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 21:08:18,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:08:18,065 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 21:08:18,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:08:18,075 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 21:08:18,079 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 21:08:18,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:08:18,101 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 21:08:18,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 21:08:18,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:08:18,107 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 21:08:18,200 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 21:08:18,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410889527] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:08:18,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:08:18,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 21:08:18,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117589676] [2022-12-13 21:08:18,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:08:18,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 21:08:18,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:18,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 21:08:18,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2022-12-13 21:08:18,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 653 [2022-12-13 21:08:18,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 234 flow. Second operand has 14 states, 14 states have (on average 189.78571428571428) internal successors, (2657), 14 states have internal predecessors, (2657), 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 21:08:18,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:18,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 653 [2022-12-13 21:08:18,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:18,930 INFO L130 PetriNetUnfolder]: 647/1260 cut-off events. [2022-12-13 21:08:18,930 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-12-13 21:08:18,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 1260 events. 647/1260 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6507 event pairs, 120 based on Foata normal form. 10/1182 useless extension candidates. Maximal degree in co-relation 2895. Up to 713 conditions per place. [2022-12-13 21:08:18,936 INFO L137 encePairwiseOnDemand]: 645/653 looper letters, 97 selfloop transitions, 13 changer transitions 0/114 dead transitions. [2022-12-13 21:08:18,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 114 transitions, 588 flow [2022-12-13 21:08:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:08:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:08:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1412 transitions. [2022-12-13 21:08:18,943 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3089039597462262 [2022-12-13 21:08:18,943 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1412 transitions. [2022-12-13 21:08:18,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1412 transitions. [2022-12-13 21:08:18,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:08:18,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1412 transitions. [2022-12-13 21:08:18,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 201.71428571428572) internal successors, (1412), 7 states have internal predecessors, (1412), 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 21:08:18,954 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 21:08:18,955 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 21:08:18,955 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 234 flow. Second operand 7 states and 1412 transitions. [2022-12-13 21:08:18,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 114 transitions, 588 flow [2022-12-13 21:08:18,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 580 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 21:08:18,959 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 287 flow [2022-12-13 21:08:18,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2022-12-13 21:08:18,960 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -30 predicate places. [2022-12-13 21:08:18,960 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 287 flow [2022-12-13 21:08:18,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 189.78571428571428) internal successors, (2657), 14 states have internal predecessors, (2657), 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 21:08:18,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:08:18,961 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:08:18,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:08:19,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 21:08:19,163 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 21:08:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2036830313, now seen corresponding path program 1 times [2022-12-13 21:08:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:08:19,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641841458] [2022-12-13 21:08:19,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:08:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:19,770 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 21:08:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:08:19,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641841458] [2022-12-13 21:08:19,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641841458] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:08:19,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210509493] [2022-12-13 21:08:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:19,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:08:19,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:08:19,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:08:19,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:08:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:19,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 21:08:19,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:19,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:08:19,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:08:19,904 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 21:08:19,905 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 21:08:19,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:08:19,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-13 21:08:19,915 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 10 treesize of output 8 [2022-12-13 21:08:20,070 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 21:08:20,169 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 21:08:20,325 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 50 treesize of output 43 [2022-12-13 21:08:20,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:08:20,386 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 69 treesize of output 71 [2022-12-13 21:08:20,430 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 21:08:20,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:08:20,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_543 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_543) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_543 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_543) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-13 21:08:20,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_540 Int) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_540) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_543) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_540 Int) (v_ArrVal_543 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_540) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_543) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-12-13 21:08:25,079 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 21:08:25,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210509493] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:08:25,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:08:25,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2022-12-13 21:08:25,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218354274] [2022-12-13 21:08:25,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:08:25,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 21:08:25,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:08:25,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 21:08:25,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=256, Unknown=4, NotChecked=70, Total=420 [2022-12-13 21:08:25,472 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 653 [2022-12-13 21:08:25,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 287 flow. Second operand has 21 states, 21 states have (on average 185.85714285714286) internal successors, (3903), 21 states have internal predecessors, (3903), 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 21:08:25,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:08:25,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 653 [2022-12-13 21:08:25,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:08:41,280 WARN L233 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 82 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:08:43,425 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 21:08:50,058 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 21:08:53,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:08:56,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:08:57,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:08:59,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:09:00,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:09:02,722 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 21:09:04,724 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 21:09:06,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:09:07,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:09:08,076 INFO L130 PetriNetUnfolder]: 1055/2074 cut-off events. [2022-12-13 21:09:08,076 INFO L131 PetriNetUnfolder]: For 735/735 co-relation queries the response was YES. [2022-12-13 21:09:08,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4906 conditions, 2074 events. 1055/2074 cut-off events. For 735/735 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11890 event pairs, 613 based on Foata normal form. 20/1970 useless extension candidates. Maximal degree in co-relation 4892. Up to 1268 conditions per place. [2022-12-13 21:09:08,081 INFO L137 encePairwiseOnDemand]: 634/653 looper letters, 134 selfloop transitions, 51 changer transitions 0/189 dead transitions. [2022-12-13 21:09:08,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 189 transitions, 1022 flow [2022-12-13 21:09:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 21:09:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 21:09:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3675 transitions. [2022-12-13 21:09:08,087 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.29620375594422504 [2022-12-13 21:09:08,087 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3675 transitions. [2022-12-13 21:09:08,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3675 transitions. [2022-12-13 21:09:08,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:09:08,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3675 transitions. [2022-12-13 21:09:08,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 193.42105263157896) internal successors, (3675), 19 states have internal predecessors, (3675), 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 21:09:08,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 653.0) internal successors, (13060), 20 states have internal predecessors, (13060), 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 21:09:08,099 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 653.0) internal successors, (13060), 20 states have internal predecessors, (13060), 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 21:09:08,099 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 287 flow. Second operand 19 states and 3675 transitions. [2022-12-13 21:09:08,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 189 transitions, 1022 flow [2022-12-13 21:09:08,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 189 transitions, 1004 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 21:09:08,103 INFO L231 Difference]: Finished difference. Result has 97 places, 113 transitions, 653 flow [2022-12-13 21:09:08,103 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=653, PETRI_PLACES=97, PETRI_TRANSITIONS=113} [2022-12-13 21:09:08,103 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, -9 predicate places. [2022-12-13 21:09:08,103 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 113 transitions, 653 flow [2022-12-13 21:09:08,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 185.85714285714286) internal successors, (3903), 21 states have internal predecessors, (3903), 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 21:09:08,104 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:09:08,104 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:09:08,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 21:09:08,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:09:08,305 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 21:09:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:09:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash -739999016, now seen corresponding path program 1 times [2022-12-13 21:09:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:09:08,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367810282] [2022-12-13 21:09:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:09:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:09:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:09:08,886 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 21:09:08,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:09:08,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367810282] [2022-12-13 21:09:08,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367810282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:09:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923065087] [2022-12-13 21:09:08,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:09:08,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:09:08,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:09:08,888 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:09:08,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 21:09:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:09:08,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 21:09:08,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:09:09,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:09:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:09:09,033 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 21:09:09,034 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 21:09:09,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:09:09,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-13 21:09:09,054 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 10 treesize of output 8 [2022-12-13 21:09:09,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:09:09,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 21:09:09,344 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 21:09:09,441 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 21:09:09,651 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 21:09:09,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:09:09,728 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 21:09:09,779 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 21:09:09,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:09:18,486 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:09:18,757 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 21:09:18,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923065087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:09:18,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:09:18,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-13 21:09:18,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477934088] [2022-12-13 21:09:18,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:09:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 21:09:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:09:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 21:09:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=438, Unknown=19, NotChecked=0, Total=600 [2022-12-13 21:09:25,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 21:09:25,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 113 transitions, 653 flow. Second operand has 25 states, 25 states have (on average 180.68) internal successors, (4517), 25 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:09:25,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:09:25,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 21:09:25,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:09:28,270 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 21:09:32,621 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 21:09:34,660 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 21:09:36,979 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 21:09:41,244 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 21:10:10,614 WARN L233 SmtUtils]: Spent 25.63s on a formula simplification. DAG size of input: 105 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:10:12,779 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 21:10:14,904 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 21:10:17,209 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 21:10:19,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:10:24,253 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 21:10:26,277 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 21:10:29,475 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 21:10:31,767 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 21:10:33,775 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 21:10:35,801 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 21:10:37,813 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 21:10:41,736 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 21:10:43,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:10:50,159 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 21:10:51,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:10:53,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:10:55,460 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 21:10:57,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:10:57,703 INFO L130 PetriNetUnfolder]: 1591/3117 cut-off events. [2022-12-13 21:10:57,703 INFO L131 PetriNetUnfolder]: For 7466/7466 co-relation queries the response was YES. [2022-12-13 21:10:57,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11295 conditions, 3117 events. 1591/3117 cut-off events. For 7466/7466 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 19779 event pairs, 523 based on Foata normal form. 27/2973 useless extension candidates. Maximal degree in co-relation 11275. Up to 1161 conditions per place. [2022-12-13 21:10:57,713 INFO L137 encePairwiseOnDemand]: 637/653 looper letters, 244 selfloop transitions, 60 changer transitions 0/308 dead transitions. [2022-12-13 21:10:57,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 308 transitions, 2460 flow [2022-12-13 21:10:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 21:10:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 21:10:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4373 transitions. [2022-12-13 21:10:57,720 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2911645249350822 [2022-12-13 21:10:57,720 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4373 transitions. [2022-12-13 21:10:57,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4373 transitions. [2022-12-13 21:10:57,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:10:57,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4373 transitions. [2022-12-13 21:10:57,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 190.1304347826087) internal successors, (4373), 23 states have internal predecessors, (4373), 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 21:10:57,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 653.0) internal successors, (15672), 24 states have internal predecessors, (15672), 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 21:10:57,734 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 653.0) internal successors, (15672), 24 states have internal predecessors, (15672), 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 21:10:57,734 INFO L175 Difference]: Start difference. First operand has 97 places, 113 transitions, 653 flow. Second operand 23 states and 4373 transitions. [2022-12-13 21:10:57,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 308 transitions, 2460 flow [2022-12-13 21:10:57,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 308 transitions, 2356 flow, removed 45 selfloop flow, removed 4 redundant places. [2022-12-13 21:10:57,743 INFO L231 Difference]: Finished difference. Result has 126 places, 143 transitions, 970 flow [2022-12-13 21:10:57,743 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=970, PETRI_PLACES=126, PETRI_TRANSITIONS=143} [2022-12-13 21:10:57,743 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 20 predicate places. [2022-12-13 21:10:57,743 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 143 transitions, 970 flow [2022-12-13 21:10:57,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 180.68) internal successors, (4517), 25 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:10:57,744 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:10:57,744 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:10:57,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 21:10:57,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:57,945 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 21:10:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:10:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1282770828, now seen corresponding path program 2 times [2022-12-13 21:10:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:10:57,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799042441] [2022-12-13 21:10:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:10:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:58,624 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 21:10:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:10:58,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799042441] [2022-12-13 21:10:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799042441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714723309] [2022-12-13 21:10:58,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:10:58,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:58,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:10:58,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:10:58,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 21:10:58,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:10:58,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:10:58,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 21:10:58,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:10:58,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:58,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:58,773 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 21:10:58,773 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 21:10:58,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:58,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-13 21:10:58,797 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 10 treesize of output 8 [2022-12-13 21:10:59,011 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 21:10:59,175 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 21:10:59,432 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 21:10:59,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:59,523 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 21:10:59,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:59,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 21:10:59,699 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 21:10:59,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:10:59,813 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_741) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_741) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-13 21:10:59,829 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_741) |c_~#queue~0.base|) .cse1))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_741) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-12-13 21:10:59,844 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 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_741) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_741) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 21:11:04,357 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 21:11:04,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714723309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:11:04,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:11:04,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-13 21:11:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710984656] [2022-12-13 21:11:04,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:11:04,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 21:11:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 21:11:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=344, Unknown=12, NotChecked=126, Total=600 [2022-12-13 21:11:05,200 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 21:11:05,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 143 transitions, 970 flow. Second operand has 25 states, 25 states have (on average 180.68) internal successors, (4517), 25 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:05,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:05,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 21:11:05,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:10,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 21:11:21,388 WARN L233 SmtUtils]: Spent 11.16s on a formula simplification. DAG size of input: 98 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:11:23,430 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 21:11:25,461 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 21:12:05,608 WARN L233 SmtUtils]: Spent 39.68s on a formula simplification. DAG size of input: 104 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:12:18,894 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 21:12:20,996 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 21:12:23,376 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 21:12:25,671 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 21:12:27,674 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 21:12:29,676 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 21:12:32,898 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 21:12:34,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 21:12:37,203 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 21:12:39,765 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 21:12:42,079 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 21:12:44,385 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 21:12:46,393 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 21:12:46,945 INFO L130 PetriNetUnfolder]: 2528/4925 cut-off events. [2022-12-13 21:12:46,945 INFO L131 PetriNetUnfolder]: For 14388/14392 co-relation queries the response was YES. [2022-12-13 21:12:46,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18918 conditions, 4925 events. 2528/4925 cut-off events. For 14388/14392 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 33973 event pairs, 794 based on Foata normal form. 39/4773 useless extension candidates. Maximal degree in co-relation 18886. Up to 2005 conditions per place. [2022-12-13 21:12:46,964 INFO L137 encePairwiseOnDemand]: 632/653 looper letters, 229 selfloop transitions, 117 changer transitions 0/350 dead transitions. [2022-12-13 21:12:46,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 350 transitions, 3024 flow [2022-12-13 21:12:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 21:12:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 21:12:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4190 transitions. [2022-12-13 21:12:46,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.29166086593345397 [2022-12-13 21:12:46,969 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4190 transitions. [2022-12-13 21:12:46,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4190 transitions. [2022-12-13 21:12:46,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:12:46,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4190 transitions. [2022-12-13 21:12:46,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 190.45454545454547) internal successors, (4190), 22 states have internal predecessors, (4190), 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 21:12:46,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 653.0) internal successors, (15019), 23 states have internal predecessors, (15019), 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 21:12:46,981 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 653.0) internal successors, (15019), 23 states have internal predecessors, (15019), 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 21:12:46,981 INFO L175 Difference]: Start difference. First operand has 126 places, 143 transitions, 970 flow. Second operand 22 states and 4190 transitions. [2022-12-13 21:12:46,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 350 transitions, 3024 flow [2022-12-13 21:12:47,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 350 transitions, 2946 flow, removed 37 selfloop flow, removed 1 redundant places. [2022-12-13 21:12:47,005 INFO L231 Difference]: Finished difference. Result has 155 places, 216 transitions, 1948 flow [2022-12-13 21:12:47,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1948, PETRI_PLACES=155, PETRI_TRANSITIONS=216} [2022-12-13 21:12:47,005 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 49 predicate places. [2022-12-13 21:12:47,005 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 216 transitions, 1948 flow [2022-12-13 21:12:47,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 180.68) internal successors, (4517), 25 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:12:47,006 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:12:47,006 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 21:12:47,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 21:12:47,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 21:12:47,207 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 21:12:47,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:12:47,209 INFO L85 PathProgramCache]: Analyzing trace with hash 38821157, now seen corresponding path program 1 times [2022-12-13 21:12:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:12:47,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105683787] [2022-12-13 21:12:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:12:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:12:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:12:47,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:12:47,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105683787] [2022-12-13 21:12:47,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105683787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:12:47,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:12:47,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:12:47,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638289335] [2022-12-13 21:12:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:12:47,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:12:47,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:12:47,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:12:47,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:12:47,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 653 [2022-12-13 21:12:47,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 216 transitions, 1948 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 21:12:47,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:12:47,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 653 [2022-12-13 21:12:47,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:12:48,145 INFO L130 PetriNetUnfolder]: 2435/4880 cut-off events. [2022-12-13 21:12:48,145 INFO L131 PetriNetUnfolder]: For 49878/49880 co-relation queries the response was YES. [2022-12-13 21:12:48,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26999 conditions, 4880 events. 2435/4880 cut-off events. For 49878/49880 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 34897 event pairs, 1049 based on Foata normal form. 12/4709 useless extension candidates. Maximal degree in co-relation 26957. Up to 2221 conditions per place. [2022-12-13 21:12:48,169 INFO L137 encePairwiseOnDemand]: 649/653 looper letters, 207 selfloop transitions, 3 changer transitions 0/230 dead transitions. [2022-12-13 21:12:48,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 230 transitions, 2517 flow [2022-12-13 21:12:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:12:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:12:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2022-12-13 21:12:48,171 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4512506380806534 [2022-12-13 21:12:48,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 884 transitions. [2022-12-13 21:12:48,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 884 transitions. [2022-12-13 21:12:48,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:12:48,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 884 transitions. [2022-12-13 21:12:48,172 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 21:12:48,173 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 21:12:48,173 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 21:12:48,173 INFO L175 Difference]: Start difference. First operand has 155 places, 216 transitions, 1948 flow. Second operand 3 states and 884 transitions. [2022-12-13 21:12:48,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 230 transitions, 2517 flow [2022-12-13 21:12:48,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 230 transitions, 2259 flow, removed 112 selfloop flow, removed 8 redundant places. [2022-12-13 21:12:48,207 INFO L231 Difference]: Finished difference. Result has 147 places, 214 transitions, 1691 flow [2022-12-13 21:12:48,208 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=147, PETRI_TRANSITIONS=214} [2022-12-13 21:12:48,208 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 41 predicate places. [2022-12-13 21:12:48,208 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 214 transitions, 1691 flow [2022-12-13 21:12:48,208 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 21:12:48,208 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:12:48,208 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:12:48,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 21:12:48,208 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 21:12:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:12:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1597687389, now seen corresponding path program 1 times [2022-12-13 21:12:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:12:48,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120333852] [2022-12-13 21:12:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:12:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:12:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:12:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:12:48,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120333852] [2022-12-13 21:12:48,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120333852] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:12:48,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443782463] [2022-12-13 21:12:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:12:48,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:12:48,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:12:48,992 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:12:48,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 21:12:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:49,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 21:12:49,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:12:49,114 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 21:12:49,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:12:49,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:12:49,149 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 21:12:49,149 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 21:12:49,166 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 52 treesize of output 50 [2022-12-13 21:12:49,176 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 10 treesize of output 8 [2022-12-13 21:12:49,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 21:12:49,392 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 21:12:49,393 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 21:12:49,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:12:49,466 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 21:12:49,586 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 21:12:49,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:12:49,646 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 21:12:49,794 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 21:12:49,795 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 21:12:49,884 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 21:12:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:12:49,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:12:50,235 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_882) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 .cse1)))))) is different from false [2022-12-13 21:12:50,278 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_876 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_876) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_882) .cse1) 20))))) is different from false [2022-12-13 21:12:50,328 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int) (v_ArrVal_876 Int) (v_ArrVal_875 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_875)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_876) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_882) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 .cse1)))))) is different from false [2022-12-13 21:12:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-13 21:12:50,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443782463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:12:50,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:12:50,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2022-12-13 21:12:50,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606316588] [2022-12-13 21:12:50,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:12:50,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 21:12:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:12:50,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 21:12:50,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=373, Unknown=13, NotChecked=132, Total=650 [2022-12-13 21:12:50,765 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 653 [2022-12-13 21:12:50,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 214 transitions, 1691 flow. Second operand has 26 states, 26 states have (on average 211.92307692307693) internal successors, (5510), 26 states have internal predecessors, (5510), 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 21:12:50,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:12:50,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 653 [2022-12-13 21:12:50,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:12:53,564 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_882 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_882) .cse1)))))) (forall ((v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 .cse1))) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_882) .cse1)))))) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 20)))) is different from false [2022-12-13 21:12:55,036 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_882 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_882) .cse1)))))) (forall ((v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| (select .cse2 .cse1))) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_86| 4) |c_~#queue~0.offset|) v_ArrVal_882) .cse1)))))))) is different from false [2022-12-13 21:12:56,315 INFO L130 PetriNetUnfolder]: 3280/6429 cut-off events. [2022-12-13 21:12:56,315 INFO L131 PetriNetUnfolder]: For 66417/66417 co-relation queries the response was YES. [2022-12-13 21:12:56,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35492 conditions, 6429 events. 3280/6429 cut-off events. For 66417/66417 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 47592 event pairs, 1678 based on Foata normal form. 58/6222 useless extension candidates. Maximal degree in co-relation 35450. Up to 3749 conditions per place. [2022-12-13 21:12:56,346 INFO L137 encePairwiseOnDemand]: 632/653 looper letters, 301 selfloop transitions, 105 changer transitions 0/410 dead transitions. [2022-12-13 21:12:56,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 410 transitions, 4508 flow [2022-12-13 21:12:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 21:12:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 21:12:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5466 transitions. [2022-12-13 21:12:56,350 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3348238897396631 [2022-12-13 21:12:56,350 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5466 transitions. [2022-12-13 21:12:56,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5466 transitions. [2022-12-13 21:12:56,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:12:56,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5466 transitions. [2022-12-13 21:12:56,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 218.64) internal successors, (5466), 25 states have internal predecessors, (5466), 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 21:12:56,362 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 21:12:56,363 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 21:12:56,363 INFO L175 Difference]: Start difference. First operand has 147 places, 214 transitions, 1691 flow. Second operand 25 states and 5466 transitions. [2022-12-13 21:12:56,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 410 transitions, 4508 flow [2022-12-13 21:12:56,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 410 transitions, 4478 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 21:12:56,406 INFO L231 Difference]: Finished difference. Result has 181 places, 277 transitions, 2803 flow [2022-12-13 21:12:56,406 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2803, PETRI_PLACES=181, PETRI_TRANSITIONS=277} [2022-12-13 21:12:56,406 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 75 predicate places. [2022-12-13 21:12:56,406 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 277 transitions, 2803 flow [2022-12-13 21:12:56,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 211.92307692307693) internal successors, (5510), 26 states have internal predecessors, (5510), 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 21:12:56,407 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:12:56,407 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:12:56,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 21:12:56,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:12:56,608 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 21:12:56,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:12:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1038590766, now seen corresponding path program 1 times [2022-12-13 21:12:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:12:56,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705061577] [2022-12-13 21:12:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:12:56,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:12:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:56,815 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 21:12:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:12:56,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705061577] [2022-12-13 21:12:56,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705061577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:12:56,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698787482] [2022-12-13 21:12:56,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:12:56,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:12:56,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:12:56,817 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:12:56,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 21:12:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:12:56,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 21:12:56,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:12:56,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:12:56,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:12:56,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:12:56,934 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 21:12:57,266 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 21:12:57,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:12:57,515 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 21:12:57,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698787482] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:12:57,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:12:57,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 21:12:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321086130] [2022-12-13 21:12:57,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:12:57,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 21:12:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:12:57,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 21:12:57,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:13:00,197 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 653 [2022-12-13 21:13:00,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 277 transitions, 2803 flow. Second operand has 11 states, 11 states have (on average 274.90909090909093) internal successors, (3024), 11 states have internal predecessors, (3024), 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 21:13:00,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:13:00,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 653 [2022-12-13 21:13:00,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:13:01,861 INFO L130 PetriNetUnfolder]: 2113/4050 cut-off events. [2022-12-13 21:13:01,861 INFO L131 PetriNetUnfolder]: For 74834/74839 co-relation queries the response was YES. [2022-12-13 21:13:01,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31440 conditions, 4050 events. 2113/4050 cut-off events. For 74834/74839 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 23770 event pairs, 642 based on Foata normal form. 301/4304 useless extension candidates. Maximal degree in co-relation 31387. Up to 1883 conditions per place. [2022-12-13 21:13:01,895 INFO L137 encePairwiseOnDemand]: 648/653 looper letters, 258 selfloop transitions, 23 changer transitions 0/307 dead transitions. [2022-12-13 21:13:01,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 307 transitions, 3931 flow [2022-12-13 21:13:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:13:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:13:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2002 transitions. [2022-12-13 21:13:01,897 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43797856049004597 [2022-12-13 21:13:01,897 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2002 transitions. [2022-12-13 21:13:01,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2002 transitions. [2022-12-13 21:13:01,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:13:01,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2002 transitions. [2022-12-13 21:13:01,899 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 21:13:01,901 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 21:13:01,901 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 21:13:01,901 INFO L175 Difference]: Start difference. First operand has 181 places, 277 transitions, 2803 flow. Second operand 7 states and 2002 transitions. [2022-12-13 21:13:01,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 307 transitions, 3931 flow [2022-12-13 21:13:01,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 307 transitions, 3649 flow, removed 130 selfloop flow, removed 7 redundant places. [2022-12-13 21:13:01,987 INFO L231 Difference]: Finished difference. Result has 181 places, 248 transitions, 2380 flow [2022-12-13 21:13:01,987 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2380, PETRI_PLACES=181, PETRI_TRANSITIONS=248} [2022-12-13 21:13:01,987 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 75 predicate places. [2022-12-13 21:13:01,988 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 248 transitions, 2380 flow [2022-12-13 21:13:01,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 274.90909090909093) internal successors, (3024), 11 states have internal predecessors, (3024), 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 21:13:01,988 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:13:01,988 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 21:13:01,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 21:13:02,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 21:13:02,190 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 21:13:02,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:13:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash -576332474, now seen corresponding path program 3 times [2022-12-13 21:13:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:13:02,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781859489] [2022-12-13 21:13:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:13:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:13:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:13:03,750 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 21:13:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:13:03,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781859489] [2022-12-13 21:13:03,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781859489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:13:03,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219048422] [2022-12-13 21:13:03,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 21:13:03,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:13:03,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:13:03,751 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:13:03,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 21:13:03,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 21:13:03,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:13:03,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 100 conjunts are in the unsatisfiable core [2022-12-13 21:13:03,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:13:03,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:13:03,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:13:03,963 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 21:13:03,968 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 21:13:03,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:13:03,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:13:04,021 INFO L321 Elim1Store]: treesize reduction 20, result has 20.0 percent of original size [2022-12-13 21:13:04,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-12-13 21:13:04,138 INFO L321 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2022-12-13 21:13:04,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 44 [2022-12-13 21:13:04,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 21:13:04,928 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 21:13:04,928 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 21:13:05,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:13:05,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 21:13:05,207 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 21:13:05,720 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 21:13:05,912 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 21:13:06,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:13:06,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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 21:13:06,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 21:13:06,383 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 21:13:06,383 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 21:13:06,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:13:06,651 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 21:13:07,082 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 21:13:07,189 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 21:13:07,335 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 21:13:07,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:13:07,543 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1092 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 21:13:50,946 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 21:13:50,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219048422] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:13:50,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:13:50,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 39 [2022-12-13 21:13:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551383895] [2022-12-13 21:13:50,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:13:50,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 21:13:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:13:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 21:13:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1219, Unknown=55, NotChecked=76, Total=1640 [2022-12-13 21:13:52,377 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 21:13:52,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 248 transitions, 2380 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 21:13:52,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:13:52,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 21:13:52,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:14:21,897 WARN L233 SmtUtils]: Spent 25.95s on a formula simplification. DAG size of input: 257 DAG size of output: 239 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:14:36,561 WARN L233 SmtUtils]: Spent 7.38s 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 21:14:42,387 WARN L233 SmtUtils]: Spent 5.53s 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 21:15:03,180 WARN L233 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:15:03,263 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |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)))) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1092 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1092 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1092) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2))))) is different from false [2022-12-13 21:15:06,857 INFO L130 PetriNetUnfolder]: 2293/4342 cut-off events. [2022-12-13 21:15:06,857 INFO L131 PetriNetUnfolder]: For 80564/80564 co-relation queries the response was YES. [2022-12-13 21:15:06,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33701 conditions, 4342 events. 2293/4342 cut-off events. For 80564/80564 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 25253 event pairs, 342 based on Foata normal form. 89/4375 useless extension candidates. Maximal degree in co-relation 33645. Up to 2045 conditions per place. [2022-12-13 21:15:06,885 INFO L137 encePairwiseOnDemand]: 635/653 looper letters, 255 selfloop transitions, 135 changer transitions 0/394 dead transitions. [2022-12-13 21:15:06,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 394 transitions, 5830 flow [2022-12-13 21:15:06,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 21:15:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 21:15:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4511 transitions. [2022-12-13 21:15:06,889 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.28783818274629913 [2022-12-13 21:15:06,889 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4511 transitions. [2022-12-13 21:15:06,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4511 transitions. [2022-12-13 21:15:06,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:15:06,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4511 transitions. [2022-12-13 21:15:06,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 187.95833333333334) internal successors, (4511), 24 states have internal predecessors, (4511), 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 21:15:06,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 653.0) internal successors, (16325), 25 states have internal predecessors, (16325), 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 21:15:06,902 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 653.0) internal successors, (16325), 25 states have internal predecessors, (16325), 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 21:15:06,902 INFO L175 Difference]: Start difference. First operand has 181 places, 248 transitions, 2380 flow. Second operand 24 states and 4511 transitions. [2022-12-13 21:15:06,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 394 transitions, 5830 flow [2022-12-13 21:15:06,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 394 transitions, 5770 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-13 21:15:06,988 INFO L231 Difference]: Finished difference. Result has 212 places, 284 transitions, 3295 flow [2022-12-13 21:15:06,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=653, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3295, PETRI_PLACES=212, PETRI_TRANSITIONS=284} [2022-12-13 21:15:06,989 INFO L288 CegarLoopForPetriNet]: 106 programPoint places, 106 predicate places. [2022-12-13 21:15:06,989 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 284 transitions, 3295 flow [2022-12-13 21:15:06,989 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 21:15:06,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:15:06,990 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 21:15:06,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 21:15:07,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 21:15:07,191 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 21:15:07,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:15:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1119130326, now seen corresponding path program 4 times [2022-12-13 21:15:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:15:07,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209413117] [2022-12-13 21:15:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:15:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:15:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:15:08,645 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 21:15:08,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:15:08,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209413117] [2022-12-13 21:15:08,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209413117] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:15:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312177538] [2022-12-13 21:15:08,646 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 21:15:08,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:15:08,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:15:08,647 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:15:08,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_388f51de-90a0-4e0f-b271-f270743863b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 21:15:08,766 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 21:15:08,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:15:08,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-13 21:15:08,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:15:08,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:15:08,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:15:08,817 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 21:15:08,817 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 21:15:08,845 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 21:15:08,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 11 [2022-12-13 21:15:09,216 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 21:15:09,410 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 21:15:09,790 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 21:15:09,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:15:09,948 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 21:15:10,194 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 21:15:10,491 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 21:15:11,027 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 21:15:11,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:15:11,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 161 treesize of output 163 [2022-12-13 21:15:11,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:15:11,425 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 21:15:11,589 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 21:15:11,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:15:23,144 WARN L233 SmtUtils]: Spent 7.59s 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 21:16:07,769 WARN L233 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:16:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:16:07,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312177538] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:16:07,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:16:07,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 37 [2022-12-13 21:16:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426326921] [2022-12-13 21:16:07,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:16:07,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 21:16:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:07,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 21:16:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1118, Unknown=84, NotChecked=0, Total=1482 [2022-12-13 21:16:11,927 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 653 [2022-12-13 21:16:11,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 284 transitions, 3295 flow. Second operand has 39 states, 39 states have (on average 180.69230769230768) internal successors, (7047), 39 states have internal predecessors, (7047), 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 21:16:11,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:16:11,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 653 [2022-12-13 21:16:11,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:16:27,896 WARN L233 SmtUtils]: Spent 10.75s on a formula simplification. DAG size of input: 171 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:16:30,203 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 21:16:32,628 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 21:17:07,592 WARN L233 SmtUtils]: Spent 29.22s on a formula simplification. DAG size of input: 144 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:17:09,628 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 21:17:11,639 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 21:17:38,435 WARN L233 SmtUtils]: Spent 23.43s on a formula simplification. DAG size of input: 148 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:17:40,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:17:56,699 WARN L233 SmtUtils]: Spent 9.50s on a formula simplification. DAG size of input: 170 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:18:05,741 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 21:18:09,340 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 21:18:24,275 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 21:18:36,535 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 21:18:38,799 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 21:18:40,813 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 21:18:48,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:19:45,812 WARN L233 SmtUtils]: Spent 36.74s on a formula simplification. DAG size of input: 111 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:19:47,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:19:49,291 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 [1] [2022-12-13 21:19:53,270 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 21:19:55,374 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 21:19:58,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:20:00,279 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 21:20:02,443 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 21:20:03,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:20:05,882 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 [1] [2022-12-13 21:20:08,013 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 21:20:10,108 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 21:20:12,386 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 21:20:27,218 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:21:40,048 WARN L233 SmtUtils]: Spent 54.82s on a formula simplification. DAG size of input: 146 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:21:41,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:21:44,454 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 21:21:46,673 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 21:21:48,697 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 21:21:50,759 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 21:21:53,447 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 21:21:55,993 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 21:21:58,265 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 21:22:00,322 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 21:22:02,332 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 21:22:04,343 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 21:22:06,383 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 21:22:08,407 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 21:22:11,107 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 21:22:13,127 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 21:22:15,132 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 21:22:17,140 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 21:22:19,264 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 21:22:30,234 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 [1] [2022-12-13 21:22:32,243 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]