./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:00:11,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:00:11,297 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:00:11,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:00:11,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:00:11,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:00:11,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:00:11,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:00:11,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:00:11,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:00:11,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:00:11,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:00:11,353 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:00:11,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:00:11,356 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:00:11,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:00:11,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:00:11,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:00:11,358 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:00:11,358 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:00:11,359 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:00:11,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:00:11,360 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:00:11,360 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:00:11,361 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:00:11,361 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:00:11,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:00:11,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:00:11,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:00:11,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:11,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:00:11,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:00:11,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:00:11,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:00:11,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:00:11,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:00:11,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:00:11,368 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:00:11,368 INFO L153 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_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/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_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2023-11-06 23:00:11,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:00:11,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:00:11,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:00:11,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:00:11,774 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:00:11,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-06 23:00:14,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:00:15,323 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:00:15,324 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-06 23:00:15,344 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/data/f8e17861c/25f75e137fe94e1884e58846c7dec167/FLAG839246b10 [2023-11-06 23:00:15,361 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/data/f8e17861c/25f75e137fe94e1884e58846c7dec167 [2023-11-06 23:00:15,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:00:15,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:00:15,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:15,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:00:15,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:00:15,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:15" (1/1) ... [2023-11-06 23:00:15,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de35b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:15, skipping insertion in model container [2023-11-06 23:00:15,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:15" (1/1) ... [2023-11-06 23:00:15,436 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:00:16,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:16,078 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:00:16,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:16,275 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:00:16,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16 WrapperNode [2023-11-06 23:00:16,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:16,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:16,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:00:16,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:00:16,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,385 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 208 [2023-11-06 23:00:16,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:16,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:00:16,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:00:16,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:00:16,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:00:16,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:00:16,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:00:16,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:00:16,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (1/1) ... [2023-11-06 23:00:16,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:16,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:16,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:00:16,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:00:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-06 23:00:16,559 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-06 23:00:16,564 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-06 23:00:16,565 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-06 23:00:16,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:00:16,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:00:16,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:00:16,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:00:16,566 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 23:00:16,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:00:16,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:00:16,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:00:16,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:00:16,570 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:00:16,754 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:00:16,756 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:00:17,359 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:00:17,372 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:00:17,373 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 23:00:17,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:17 BoogieIcfgContainer [2023-11-06 23:00:17,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:00:17,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:00:17,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:00:17,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:00:17,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:00:15" (1/3) ... [2023-11-06 23:00:17,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2445bfdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:17, skipping insertion in model container [2023-11-06 23:00:17,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:16" (2/3) ... [2023-11-06 23:00:17,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2445bfdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:17, skipping insertion in model container [2023-11-06 23:00:17,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:17" (3/3) ... [2023-11-06 23:00:17,387 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-11-06 23:00:17,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:00:17,409 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-11-06 23:00:17,410 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:00:17,685 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 23:00:17,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 298 transitions, 610 flow [2023-11-06 23:00:17,973 INFO L124 PetriNetUnfolderBase]: 15/296 cut-off events. [2023-11-06 23:00:17,974 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 23:00:17,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 296 events. 15/296 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 704 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 196. Up to 3 conditions per place. [2023-11-06 23:00:17,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 298 transitions, 610 flow [2023-11-06 23:00:18,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 283 places, 291 transitions, 594 flow [2023-11-06 23:00:18,010 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:00:18,025 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 283 places, 291 transitions, 594 flow [2023-11-06 23:00:18,035 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 283 places, 291 transitions, 594 flow [2023-11-06 23:00:18,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 283 places, 291 transitions, 594 flow [2023-11-06 23:00:18,141 INFO L124 PetriNetUnfolderBase]: 15/291 cut-off events. [2023-11-06 23:00:18,142 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 23:00:18,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 291 events. 15/291 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 686 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 196. Up to 3 conditions per place. [2023-11-06 23:00:18,165 INFO L119 LiptonReduction]: Number of co-enabled transitions 19748 [2023-11-06 23:00:35,277 INFO L134 LiptonReduction]: Checked pairs total: 61464 [2023-11-06 23:00:35,277 INFO L136 LiptonReduction]: Total number of compositions: 393 [2023-11-06 23:00:35,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:00:35,302 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;@415a5cf5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:00:35,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-06 23:00:35,304 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:00:35,304 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:00:35,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:35,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:35,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:00:35,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:35,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1256, now seen corresponding path program 1 times [2023-11-06 23:00:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113920501] [2023-11-06 23:00:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:35,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:35,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113920501] [2023-11-06 23:00:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113920501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:35,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:00:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523236517] [2023-11-06 23:00:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:35,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:00:35,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:00:35,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:00:35,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 691 [2023-11-06 23:00:35,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 285.5) internal successors, (571), 2 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:35,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:35,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 691 [2023-11-06 23:00:35,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:36,624 INFO L124 PetriNetUnfolderBase]: 4087/6349 cut-off events. [2023-11-06 23:00:36,624 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-06 23:00:36,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12655 conditions, 6349 events. 4087/6349 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 35186 event pairs, 3451 based on Foata normal form. 0/3225 useless extension candidates. Maximal degree in co-relation 12174. Up to 6236 conditions per place. [2023-11-06 23:00:36,686 INFO L140 encePairwiseOnDemand]: 655/691 looper letters, 63 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-11-06 23:00:36,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 278 flow [2023-11-06 23:00:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:00:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:00:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 669 transitions. [2023-11-06 23:00:36,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4840810419681621 [2023-11-06 23:00:36,717 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 669 transitions. [2023-11-06 23:00:36,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 669 transitions. [2023-11-06 23:00:36,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:36,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 669 transitions. [2023-11-06 23:00:36,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 334.5) internal successors, (669), 2 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:36,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 691.0) internal successors, (2073), 3 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:36,747 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 691.0) internal successors, (2073), 3 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:36,749 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 669 transitions. [2023-11-06 23:00:36,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 278 flow [2023-11-06 23:00:36,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:00:36,762 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-11-06 23:00:36,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, 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} [2023-11-06 23:00:36,768 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-11-06 23:00:36,768 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-11-06 23:00:36,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 285.5) internal successors, (571), 2 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:36,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:36,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 23:00:36,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:00:36,771 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)] === [2023-11-06 23:00:36,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1245768, now seen corresponding path program 1 times [2023-11-06 23:00:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144848090] [2023-11-06 23:00:36,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:37,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:37,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144848090] [2023-11-06 23:00:37,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144848090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:37,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:37,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:00:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613509218] [2023-11-06 23:00:37,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:37,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:37,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 691 [2023-11-06 23:00:37,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 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) [2023-11-06 23:00:37,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:37,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 691 [2023-11-06 23:00:37,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:38,133 INFO L124 PetriNetUnfolderBase]: 4037/6251 cut-off events. [2023-11-06 23:00:38,133 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 23:00:38,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 6251 events. 4037/6251 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 34392 event pairs, 3408 based on Foata normal form. 0/3195 useless extension candidates. Maximal degree in co-relation 12411. Up to 6139 conditions per place. [2023-11-06 23:00:38,258 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 59 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-06 23:00:38,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 262 flow [2023-11-06 23:00:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2023-11-06 23:00:38,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4283646888567294 [2023-11-06 23:00:38,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 888 transitions. [2023-11-06 23:00:38,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 888 transitions. [2023-11-06 23:00:38,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:38,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 888 transitions. [2023-11-06 23:00:38,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:38,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:38,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:38,293 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 888 transitions. [2023-11-06 23:00:38,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 262 flow [2023-11-06 23:00:38,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:00:38,296 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-11-06 23:00:38,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, 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} [2023-11-06 23:00:38,298 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-11-06 23:00:38,298 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-11-06 23:00:38,299 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) [2023-11-06 23:00:38,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:38,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 23:00:38,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:00:38,300 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)] === [2023-11-06 23:00:38,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1245769, now seen corresponding path program 1 times [2023-11-06 23:00:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:38,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629845629] [2023-11-06 23:00:38,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629845629] [2023-11-06 23:00:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629845629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:00:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469999144] [2023-11-06 23:00:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:38,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 691 [2023-11-06 23:00:38,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 144 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) [2023-11-06 23:00:38,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:38,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 691 [2023-11-06 23:00:38,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:39,537 INFO L124 PetriNetUnfolderBase]: 3987/6153 cut-off events. [2023-11-06 23:00:39,537 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 23:00:39,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12224 conditions, 6153 events. 3987/6153 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 33652 event pairs, 3365 based on Foata normal form. 0/3165 useless extension candidates. Maximal degree in co-relation 12220. Up to 6044 conditions per place. [2023-11-06 23:00:39,581 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 57 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-06 23:00:39,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 258 flow [2023-11-06 23:00:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2023-11-06 23:00:39,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331886155330439 [2023-11-06 23:00:39,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 898 transitions. [2023-11-06 23:00:39,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 898 transitions. [2023-11-06 23:00:39,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:39,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 898 transitions. [2023-11-06 23:00:39,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:39,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:39,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:39,600 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 898 transitions. [2023-11-06 23:00:39,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 258 flow [2023-11-06 23:00:39,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:39,603 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-11-06 23:00:39,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, 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} [2023-11-06 23:00:39,605 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-11-06 23:00:39,605 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-11-06 23:00:39,606 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) [2023-11-06 23:00:39,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:39,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:00:39,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:00:39,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:39,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1197200326, now seen corresponding path program 1 times [2023-11-06 23:00:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:39,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943637039] [2023-11-06 23:00:39,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:39,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:40,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943637039] [2023-11-06 23:00:40,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943637039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:40,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:40,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:00:40,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136362520] [2023-11-06 23:00:40,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:40,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:40,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 691 [2023-11-06 23:00:40,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:40,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:40,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 691 [2023-11-06 23:00:40,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:41,098 INFO L124 PetriNetUnfolderBase]: 4092/6372 cut-off events. [2023-11-06 23:00:41,099 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 23:00:41,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12663 conditions, 6372 events. 4092/6372 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35325 event pairs, 3006 based on Foata normal form. 0/3179 useless extension candidates. Maximal degree in co-relation 12659. Up to 6257 conditions per place. [2023-11-06 23:00:41,145 INFO L140 encePairwiseOnDemand]: 685/691 looper letters, 65 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-11-06 23:00:41,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 296 flow [2023-11-06 23:00:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2023-11-06 23:00:41,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4278822961890979 [2023-11-06 23:00:41,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2023-11-06 23:00:41,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2023-11-06 23:00:41,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:41,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2023-11-06 23:00:41,157 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) [2023-11-06 23:00:41,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:41,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:41,166 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 887 transitions. [2023-11-06 23:00:41,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 296 flow [2023-11-06 23:00:41,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:41,173 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2023-11-06 23:00:41,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2023-11-06 23:00:41,174 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-11-06 23:00:41,175 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2023-11-06 23:00:41,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:41,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:41,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:00:41,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:00:41,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:41,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1197200324, now seen corresponding path program 1 times [2023-11-06 23:00:41,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560876509] [2023-11-06 23:00:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:41,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560876509] [2023-11-06 23:00:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560876509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:00:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61829261] [2023-11-06 23:00:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:41,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:41,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:41,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 691 [2023-11-06 23:00:41,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:41,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:41,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 691 [2023-11-06 23:00:41,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:42,224 INFO L124 PetriNetUnfolderBase]: 3525/5435 cut-off events. [2023-11-06 23:00:42,225 INFO L125 PetriNetUnfolderBase]: For 231/322 co-relation queries the response was YES. [2023-11-06 23:00:42,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11125 conditions, 5435 events. 3525/5435 cut-off events. For 231/322 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 29043 event pairs, 2925 based on Foata normal form. 0/3035 useless extension candidates. Maximal degree in co-relation 11120. Up to 5334 conditions per place. [2023-11-06 23:00:42,262 INFO L140 encePairwiseOnDemand]: 686/691 looper letters, 56 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-06 23:00:42,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 274 flow [2023-11-06 23:00:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2023-11-06 23:00:42,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365653642064641 [2023-11-06 23:00:42,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2023-11-06 23:00:42,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2023-11-06 23:00:42,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:42,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2023-11-06 23:00:42,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:42,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:42,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:42,283 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 164 flow. Second operand 3 states and 905 transitions. [2023-11-06 23:00:42,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 274 flow [2023-11-06 23:00:42,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:00:42,287 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 158 flow [2023-11-06 23:00:42,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=158, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2023-11-06 23:00:42,291 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-11-06 23:00:42,292 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 158 flow [2023-11-06 23:00:42,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:42,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:42,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:00:42,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:00:42,294 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:42,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:42,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1197212169, now seen corresponding path program 1 times [2023-11-06 23:00:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:42,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451764875] [2023-11-06 23:00:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:42,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451764875] [2023-11-06 23:00:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451764875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:42,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095587347] [2023-11-06 23:00:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:42,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:42,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:42,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 691 [2023-11-06 23:00:42,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 272.25) internal successors, (1089), 4 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:42,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:42,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 691 [2023-11-06 23:00:42,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:43,149 INFO L124 PetriNetUnfolderBase]: 2559/4017 cut-off events. [2023-11-06 23:00:43,150 INFO L125 PetriNetUnfolderBase]: For 183/251 co-relation queries the response was YES. [2023-11-06 23:00:43,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8231 conditions, 4017 events. 2559/4017 cut-off events. For 183/251 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 20817 event pairs, 2103 based on Foata normal form. 0/2425 useless extension candidates. Maximal degree in co-relation 8226. Up to 3936 conditions per place. [2023-11-06 23:00:43,177 INFO L140 encePairwiseOnDemand]: 688/691 looper letters, 55 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-06 23:00:43,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 270 flow [2023-11-06 23:00:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2023-11-06 23:00:43,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4191992281717318 [2023-11-06 23:00:43,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 869 transitions. [2023-11-06 23:00:43,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 869 transitions. [2023-11-06 23:00:43,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:43,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 869 transitions. [2023-11-06 23:00:43,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:43,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:43,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:43,195 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 158 flow. Second operand 3 states and 869 transitions. [2023-11-06 23:00:43,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 270 flow [2023-11-06 23:00:43,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:43,201 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 156 flow [2023-11-06 23:00:43,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-11-06 23:00:43,204 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-11-06 23:00:43,205 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 156 flow [2023-11-06 23:00:43,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 272.25) internal successors, (1089), 4 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:43,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:43,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:00:43,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:00:43,207 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)] === [2023-11-06 23:00:43,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1197212170, now seen corresponding path program 1 times [2023-11-06 23:00:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:43,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371273729] [2023-11-06 23:00:43,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:43,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:43,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371273729] [2023-11-06 23:00:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371273729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:43,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:43,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:43,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613954537] [2023-11-06 23:00:43,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:43,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:43,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:43,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:43,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:43,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 691 [2023-11-06 23:00:43,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 278.25) internal successors, (1113), 4 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:43,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:43,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 691 [2023-11-06 23:00:43,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:43,963 INFO L124 PetriNetUnfolderBase]: 1593/2599 cut-off events. [2023-11-06 23:00:43,963 INFO L125 PetriNetUnfolderBase]: For 135/180 co-relation queries the response was YES. [2023-11-06 23:00:43,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 2599 events. 1593/2599 cut-off events. For 135/180 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 13106 event pairs, 1281 based on Foata normal form. 0/1815 useless extension candidates. Maximal degree in co-relation 5338. Up to 2538 conditions per place. [2023-11-06 23:00:43,978 INFO L140 encePairwiseOnDemand]: 688/691 looper letters, 54 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-06 23:00:43,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 266 flow [2023-11-06 23:00:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2023-11-06 23:00:43,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42739990352146645 [2023-11-06 23:00:43,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 886 transitions. [2023-11-06 23:00:43,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 886 transitions. [2023-11-06 23:00:43,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:43,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 886 transitions. [2023-11-06 23:00:43,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:43,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:43,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:43,996 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 156 flow. Second operand 3 states and 886 transitions. [2023-11-06 23:00:43,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 266 flow [2023-11-06 23:00:43,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:43,999 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 154 flow [2023-11-06 23:00:43,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2023-11-06 23:00:44,000 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2023-11-06 23:00:44,001 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 154 flow [2023-11-06 23:00:44,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.25) internal successors, (1113), 4 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:44,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:44,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:00:44,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:00:44,005 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:44,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:44,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1541341198, now seen corresponding path program 1 times [2023-11-06 23:00:44,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:44,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466176648] [2023-11-06 23:00:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466176648] [2023-11-06 23:00:44,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466176648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:44,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:44,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621607260] [2023-11-06 23:00:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:44,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:44,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:44,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:44,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 691 [2023-11-06 23:00:44,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:44,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:44,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 691 [2023-11-06 23:00:44,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:45,445 INFO L124 PetriNetUnfolderBase]: 1955/3218 cut-off events. [2023-11-06 23:00:45,446 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-06 23:00:45,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6627 conditions, 3218 events. 1955/3218 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 17334 event pairs, 497 based on Foata normal form. 23/2288 useless extension candidates. Maximal degree in co-relation 6622. Up to 2697 conditions per place. [2023-11-06 23:00:45,467 INFO L140 encePairwiseOnDemand]: 679/691 looper letters, 76 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2023-11-06 23:00:45,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 383 flow [2023-11-06 23:00:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:00:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1164 transitions. [2023-11-06 23:00:45,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4211287988422576 [2023-11-06 23:00:45,474 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1164 transitions. [2023-11-06 23:00:45,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1164 transitions. [2023-11-06 23:00:45,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:45,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1164 transitions. [2023-11-06 23:00:45,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:45,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:45,488 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:45,488 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 154 flow. Second operand 4 states and 1164 transitions. [2023-11-06 23:00:45,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 383 flow [2023-11-06 23:00:45,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:45,493 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 210 flow [2023-11-06 23:00:45,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2023-11-06 23:00:45,495 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-11-06 23:00:45,496 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 210 flow [2023-11-06 23:00:45,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:45,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:45,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:00:45,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:00:45,501 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:45,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1541494502, now seen corresponding path program 1 times [2023-11-06 23:00:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715645057] [2023-11-06 23:00:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715645057] [2023-11-06 23:00:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715645057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:45,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:45,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984526233] [2023-11-06 23:00:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:45,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:45,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:45,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 691 [2023-11-06 23:00:45,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 69 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:45,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:45,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 691 [2023-11-06 23:00:45,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:46,488 INFO L124 PetriNetUnfolderBase]: 1681/2804 cut-off events. [2023-11-06 23:00:46,488 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2023-11-06 23:00:46,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6076 conditions, 2804 events. 1681/2804 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15248 event pairs, 832 based on Foata normal form. 72/2248 useless extension candidates. Maximal degree in co-relation 6070. Up to 1650 conditions per place. [2023-11-06 23:00:46,512 INFO L140 encePairwiseOnDemand]: 683/691 looper letters, 81 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-11-06 23:00:46,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 439 flow [2023-11-06 23:00:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:00:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1171 transitions. [2023-11-06 23:00:46,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236613603473227 [2023-11-06 23:00:46,519 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1171 transitions. [2023-11-06 23:00:46,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1171 transitions. [2023-11-06 23:00:46,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:46,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1171 transitions. [2023-11-06 23:00:46,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 292.75) internal successors, (1171), 4 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,533 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,534 INFO L175 Difference]: Start difference. First operand has 64 places, 69 transitions, 210 flow. Second operand 4 states and 1171 transitions. [2023-11-06 23:00:46,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 439 flow [2023-11-06 23:00:46,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:00:46,540 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 189 flow [2023-11-06 23:00:46,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2023-11-06 23:00:46,541 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-11-06 23:00:46,542 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 189 flow [2023-11-06 23:00:46,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:46,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:46,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:00:46,544 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:46,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1639865106, now seen corresponding path program 1 times [2023-11-06 23:00:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:46,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768224190] [2023-11-06 23:00:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768224190] [2023-11-06 23:00:46,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768224190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:46,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952403962] [2023-11-06 23:00:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:46,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:46,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:46,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 691 [2023-11-06 23:00:46,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:46,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 691 [2023-11-06 23:00:46,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:46,868 INFO L124 PetriNetUnfolderBase]: 446/881 cut-off events. [2023-11-06 23:00:46,869 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-11-06 23:00:46,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 881 events. 446/881 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4476 event pairs, 270 based on Foata normal form. 40/806 useless extension candidates. Maximal degree in co-relation 1904. Up to 441 conditions per place. [2023-11-06 23:00:46,876 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 65 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-11-06 23:00:46,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 361 flow [2023-11-06 23:00:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2023-11-06 23:00:46,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356005788712012 [2023-11-06 23:00:46,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 903 transitions. [2023-11-06 23:00:46,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 903 transitions. [2023-11-06 23:00:46,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:46,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 903 transitions. [2023-11-06 23:00:46,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,894 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 189 flow. Second operand 3 states and 903 transitions. [2023-11-06 23:00:46,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 361 flow [2023-11-06 23:00:46,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 351 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:00:46,899 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 190 flow [2023-11-06 23:00:46,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2023-11-06 23:00:46,900 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-11-06 23:00:46,900 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 190 flow [2023-11-06 23:00:46,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:46,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:46,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:46,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:00:46,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:46,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1024067661, now seen corresponding path program 1 times [2023-11-06 23:00:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945563661] [2023-11-06 23:00:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:47,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945563661] [2023-11-06 23:00:47,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945563661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:47,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:47,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:00:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591770649] [2023-11-06 23:00:47,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:47,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:47,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:47,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:47,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 691 [2023-11-06 23:00:47,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:47,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:47,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 691 [2023-11-06 23:00:47,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:47,366 INFO L124 PetriNetUnfolderBase]: 413/840 cut-off events. [2023-11-06 23:00:47,366 INFO L125 PetriNetUnfolderBase]: For 90/92 co-relation queries the response was YES. [2023-11-06 23:00:47,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 840 events. 413/840 cut-off events. For 90/92 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4324 event pairs, 341 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 1799. Up to 762 conditions per place. [2023-11-06 23:00:47,372 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 50 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-11-06 23:00:47,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 292 flow [2023-11-06 23:00:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2023-11-06 23:00:47,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.426917510853835 [2023-11-06 23:00:47,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 885 transitions. [2023-11-06 23:00:47,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 885 transitions. [2023-11-06 23:00:47,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:47,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 885 transitions. [2023-11-06 23:00:47,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:47,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:47,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:47,388 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 190 flow. Second operand 3 states and 885 transitions. [2023-11-06 23:00:47,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 292 flow [2023-11-06 23:00:47,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:47,392 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 186 flow [2023-11-06 23:00:47,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=61, PETRI_TRANSITIONS=62} [2023-11-06 23:00:47,393 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-11-06 23:00:47,393 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 186 flow [2023-11-06 23:00:47,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:47,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:47,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:47,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:00:47,395 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:47,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1024067660, now seen corresponding path program 1 times [2023-11-06 23:00:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:47,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049763257] [2023-11-06 23:00:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049763257] [2023-11-06 23:00:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049763257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351694699] [2023-11-06 23:00:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:47,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:47,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:47,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:47,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 691 [2023-11-06 23:00:47,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:47,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:47,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 691 [2023-11-06 23:00:47,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:48,190 INFO L124 PetriNetUnfolderBase]: 381/766 cut-off events. [2023-11-06 23:00:48,190 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-11-06 23:00:48,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 766 events. 381/766 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3597 event pairs, 252 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 1647. Up to 567 conditions per place. [2023-11-06 23:00:48,195 INFO L140 encePairwiseOnDemand]: 686/691 looper letters, 63 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-11-06 23:00:48,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 345 flow [2023-11-06 23:00:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:00:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1181 transitions. [2023-11-06 23:00:48,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4272793053545586 [2023-11-06 23:00:48,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1181 transitions. [2023-11-06 23:00:48,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1181 transitions. [2023-11-06 23:00:48,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:48,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1181 transitions. [2023-11-06 23:00:48,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 295.25) internal successors, (1181), 4 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:48,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:48,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:48,212 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 186 flow. Second operand 4 states and 1181 transitions. [2023-11-06 23:00:48,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 345 flow [2023-11-06 23:00:48,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 329 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:48,216 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 178 flow [2023-11-06 23:00:48,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=178, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2023-11-06 23:00:48,216 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-11-06 23:00:48,217 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 178 flow [2023-11-06 23:00:48,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:48,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:48,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:48,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:00:48,218 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:48,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1681325168, now seen corresponding path program 1 times [2023-11-06 23:00:48,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:48,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33752695] [2023-11-06 23:00:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:48,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:48,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33752695] [2023-11-06 23:00:48,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33752695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:48,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:00:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201279869] [2023-11-06 23:00:48,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:48,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:00:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:00:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:00:49,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 691 [2023-11-06 23:00:49,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:49,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:49,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 691 [2023-11-06 23:00:49,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:49,437 INFO L124 PetriNetUnfolderBase]: 395/779 cut-off events. [2023-11-06 23:00:49,438 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-11-06 23:00:49,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 779 events. 395/779 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3639 event pairs, 312 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 1705. Up to 731 conditions per place. [2023-11-06 23:00:49,442 INFO L140 encePairwiseOnDemand]: 684/691 looper letters, 58 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2023-11-06 23:00:49,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 345 flow [2023-11-06 23:00:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:00:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:00:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2023-11-06 23:00:49,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035214664737096 [2023-11-06 23:00:49,451 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1673 transitions. [2023-11-06 23:00:49,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1673 transitions. [2023-11-06 23:00:49,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:49,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1673 transitions. [2023-11-06 23:00:49,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 278.8333333333333) internal successors, (1673), 6 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:49,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 691.0) internal successors, (4837), 7 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:49,467 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 691.0) internal successors, (4837), 7 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:49,467 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 178 flow. Second operand 6 states and 1673 transitions. [2023-11-06 23:00:49,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 345 flow [2023-11-06 23:00:49,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:49,470 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 229 flow [2023-11-06 23:00:49,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2023-11-06 23:00:49,471 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-11-06 23:00:49,472 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 229 flow [2023-11-06 23:00:49,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:49,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:49,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:49,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:00:49,473 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:49,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash 847883346, now seen corresponding path program 1 times [2023-11-06 23:00:49,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:49,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464375070] [2023-11-06 23:00:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464375070] [2023-11-06 23:00:50,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464375070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:50,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:50,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:00:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237786369] [2023-11-06 23:00:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:50,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:00:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:00:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:51,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 691 [2023-11-06 23:00:51,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 265.85714285714283) internal successors, (1861), 7 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:51,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:51,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 691 [2023-11-06 23:00:51,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:51,480 INFO L124 PetriNetUnfolderBase]: 443/869 cut-off events. [2023-11-06 23:00:51,481 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-11-06 23:00:51,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 869 events. 443/869 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4159 event pairs, 115 based on Foata normal form. 7/794 useless extension candidates. Maximal degree in co-relation 2012. Up to 653 conditions per place. [2023-11-06 23:00:51,486 INFO L140 encePairwiseOnDemand]: 683/691 looper letters, 74 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2023-11-06 23:00:51,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 475 flow [2023-11-06 23:00:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:00:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:00:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1932 transitions. [2023-11-06 23:00:51,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994211287988423 [2023-11-06 23:00:51,496 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1932 transitions. [2023-11-06 23:00:51,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1932 transitions. [2023-11-06 23:00:51,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:51,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1932 transitions. [2023-11-06 23:00:51,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:51,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 691.0) internal successors, (5528), 8 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:51,513 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 691.0) internal successors, (5528), 8 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:51,513 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 229 flow. Second operand 7 states and 1932 transitions. [2023-11-06 23:00:51,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 475 flow [2023-11-06 23:00:51,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 467 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 23:00:51,517 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 291 flow [2023-11-06 23:00:51,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2023-11-06 23:00:51,518 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -29 predicate places. [2023-11-06 23:00:51,518 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 291 flow [2023-11-06 23:00:51,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 265.85714285714283) internal successors, (1861), 7 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:51,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:51,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:51,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:00:51,520 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:51,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1437450654, now seen corresponding path program 2 times [2023-11-06 23:00:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:51,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889404445] [2023-11-06 23:00:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889404445] [2023-11-06 23:00:51,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889404445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167345907] [2023-11-06 23:00:51,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:00:51,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:51,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:51,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:51,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:00:52,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:00:52,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:00:52,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 23:00:52,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:52,350 INFO L351 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 [2023-11-06 23:00:52,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,397 INFO L351 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 18 treesize of output 13 [2023-11-06 23:00:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:52,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:52,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-11-06 23:00:52,525 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:52,526 INFO L351 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 [2023-11-06 23:00:52,537 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:52,538 INFO L351 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 46 treesize of output 45 [2023-11-06 23:00:52,544 INFO L351 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 [2023-11-06 23:00:52,569 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 23:00:52,570 INFO L351 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 22 treesize of output 1 [2023-11-06 23:00:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167345907] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:52,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-11-06 23:00:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988860779] [2023-11-06 23:00:52,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:52,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:00:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:52,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:00:52,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=134, Unknown=2, NotChecked=0, Total=182 [2023-11-06 23:00:53,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 691 [2023-11-06 23:00:53,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 291 flow. Second operand has 14 states, 14 states have (on average 193.78571428571428) internal successors, (2713), 14 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:53,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:53,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 691 [2023-11-06 23:00:53,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:54,610 INFO L124 PetriNetUnfolderBase]: 574/1150 cut-off events. [2023-11-06 23:00:54,611 INFO L125 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2023-11-06 23:00:54,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 1150 events. 574/1150 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6140 event pairs, 283 based on Foata normal form. 8/1060 useless extension candidates. Maximal degree in co-relation 2753. Up to 445 conditions per place. [2023-11-06 23:00:54,620 INFO L140 encePairwiseOnDemand]: 679/691 looper letters, 89 selfloop transitions, 20 changer transitions 0/115 dead transitions. [2023-11-06 23:00:54,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 115 transitions, 638 flow [2023-11-06 23:00:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:00:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:00:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1631 transitions. [2023-11-06 23:00:54,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2950434153400868 [2023-11-06 23:00:54,630 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1631 transitions. [2023-11-06 23:00:54,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1631 transitions. [2023-11-06 23:00:54,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:54,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1631 transitions. [2023-11-06 23:00:54,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 203.875) internal successors, (1631), 8 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:54,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 691.0) internal successors, (6219), 9 states have internal predecessors, (6219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:54,647 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 691.0) internal successors, (6219), 9 states have internal predecessors, (6219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:54,647 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 291 flow. Second operand 8 states and 1631 transitions. [2023-11-06 23:00:54,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 115 transitions, 638 flow [2023-11-06 23:00:54,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 617 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:54,653 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 356 flow [2023-11-06 23:00:54,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=356, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2023-11-06 23:00:54,656 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -25 predicate places. [2023-11-06 23:00:54,656 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 356 flow [2023-11-06 23:00:54,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 193.78571428571428) internal successors, (2713), 14 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:54,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:54,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:54,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 23:00:54,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 23:00:54,864 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:00:54,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash -587706807, now seen corresponding path program 1 times [2023-11-06 23:00:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472251176] [2023-11-06 23:00:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:54,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472251176] [2023-11-06 23:00:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472251176] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073937397] [2023-11-06 23:00:55,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:55,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:55,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:55,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:00:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:56,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-06 23:00:56,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:56,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,148 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:56,260 INFO L322 Elim1Store]: treesize reduction 124, result has 41.5 percent of original size [2023-11-06 23:00:56,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 231 [2023-11-06 23:00:56,294 INFO L351 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 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 23:00:56,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:56,489 INFO L351 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 60 treesize of output 38 [2023-11-06 23:00:56,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,546 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:56,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:56,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:56,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2023-11-06 23:00:58,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:58,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:58,112 INFO L322 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2023-11-06 23:00:58,113 INFO L351 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 349 treesize of output 326 [2023-11-06 23:00:58,138 INFO L351 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 251 treesize of output 249 [2023-11-06 23:00:58,150 INFO L351 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 249 treesize of output 247 [2023-11-06 23:00:58,162 INFO L351 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 247 treesize of output 245 [2023-11-06 23:00:58,173 INFO L351 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 245 treesize of output 243 [2023-11-06 23:00:58,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:58,946 INFO L351 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 362 treesize of output 320 [2023-11-06 23:01:00,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:00,286 INFO L351 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 466 treesize of output 404 [2023-11-06 23:01:01,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:01,094 INFO L351 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 783 treesize of output 678 [2023-11-06 23:01:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:01,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:01:01,521 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_334 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_334 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-06 23:01:01,630 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_334 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_334 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-06 23:01:01,846 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| Int) (v_ArrVal_334 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_331))) (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| 1)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| Int) (v_ArrVal_334 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_331))) (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| 1)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 23:01:03,920 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse4 .cse3))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| Int) (v_ArrVal_334 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_331))) (store (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|) .cse3) 4)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| Int) (v_ArrVal_334 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_331))) (store (store .cse5 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))))) is different from false [2023-11-06 23:01:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 23:01:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073937397] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:01:04,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:01:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-11-06 23:01:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098128896] [2023-11-06 23:01:04,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:01:04,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 23:01:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:04,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 23:01:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=256, Unknown=15, NotChecked=148, Total=506 [2023-11-06 23:01:04,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 691 [2023-11-06 23:01:04,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 356 flow. Second operand has 23 states, 23 states have (on average 189.69565217391303) internal successors, (4363), 23 states have internal predecessors, (4363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:04,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:04,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 691 [2023-11-06 23:01:04,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:12,919 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] [2023-11-06 23:01:14,819 INFO L124 PetriNetUnfolderBase]: 708/1426 cut-off events. [2023-11-06 23:01:14,819 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2023-11-06 23:01:14,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1426 events. 708/1426 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8227 event pairs, 510 based on Foata normal form. 8/1331 useless extension candidates. Maximal degree in co-relation 3481. Up to 1091 conditions per place. [2023-11-06 23:01:14,828 INFO L140 encePairwiseOnDemand]: 678/691 looper letters, 95 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2023-11-06 23:01:14,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 127 transitions, 780 flow [2023-11-06 23:01:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 23:01:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-06 23:01:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2928 transitions. [2023-11-06 23:01:14,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2824891461649783 [2023-11-06 23:01:14,841 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2928 transitions. [2023-11-06 23:01:14,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2928 transitions. [2023-11-06 23:01:14,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:14,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2928 transitions. [2023-11-06 23:01:14,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 195.2) internal successors, (2928), 15 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:14,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 691.0) internal successors, (11056), 16 states have internal predecessors, (11056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:14,875 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 691.0) internal successors, (11056), 16 states have internal predecessors, (11056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:14,875 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 356 flow. Second operand 15 states and 2928 transitions. [2023-11-06 23:01:14,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 127 transitions, 780 flow [2023-11-06 23:01:14,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 127 transitions, 741 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-11-06 23:01:14,883 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 516 flow [2023-11-06 23:01:14,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=516, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2023-11-06 23:01:14,884 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -6 predicate places. [2023-11-06 23:01:14,884 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 516 flow [2023-11-06 23:01:14,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 189.69565217391303) internal successors, (4363), 23 states have internal predecessors, (4363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:14,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:14,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:14,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:01:15,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 23:01:15,093 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:01:15,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 508345799, now seen corresponding path program 1 times [2023-11-06 23:01:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519107992] [2023-11-06 23:01:15,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519107992] [2023-11-06 23:01:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519107992] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:01:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996864281] [2023-11-06 23:01:16,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:16,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:16,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:16,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:01:16,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:01:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:16,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 23:01:16,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:16,321 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:01:16,321 INFO L351 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 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-06 23:01:16,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,333 INFO L351 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 26 treesize of output 15 [2023-11-06 23:01:16,363 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:01:16,363 INFO L351 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 [2023-11-06 23:01:16,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 15 [2023-11-06 23:01:16,623 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 23:01:16,623 INFO L351 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 1 case distinctions, treesize of input 62 treesize of output 55 [2023-11-06 23:01:16,892 INFO L351 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 80 treesize of output 71 [2023-11-06 23:01:17,144 INFO L351 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 97 treesize of output 86 [2023-11-06 23:01:17,651 INFO L351 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 107 treesize of output 90 [2023-11-06 23:01:17,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:17,845 INFO L351 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 142 treesize of output 123 [2023-11-06 23:01:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:18,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:01:18,076 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_396 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_396 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 23:01:18,093 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_396 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_396 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 23:01:18,200 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_396 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_396 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2023-11-06 23:01:18,242 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_392 Int) (v_ArrVal_396 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_392))) (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_392 Int) (v_ArrVal_396 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_392))) (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 23:01:20,305 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (forall ((v_ArrVal_392 Int) (v_ArrVal_396 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_392))) (store (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (forall ((v_ArrVal_392 Int) (v_ArrVal_396 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_392))) (store (store .cse5 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse3) 4))))))))) is different from false [2023-11-06 23:01:20,339 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_391 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_391))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_392 Int) (v_ArrVal_396 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_392))) (store (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|))))) (forall ((v_ArrVal_391 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_391))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (forall ((v_ArrVal_392 Int) (v_ArrVal_396 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_392))) (store (store .cse7 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) is different from false [2023-11-06 23:01:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 23:01:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996864281] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:01:20,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:01:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-06 23:01:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4271136] [2023-11-06 23:01:20,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:01:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 23:01:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 23:01:20,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=285, Unknown=8, NotChecked=246, Total=650 [2023-11-06 23:01:20,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 691 [2023-11-06 23:01:20,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 516 flow. Second operand has 26 states, 26 states have (on average 183.6153846153846) internal successors, (4774), 26 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:20,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 691 [2023-11-06 23:01:20,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:22,717 INFO L124 PetriNetUnfolderBase]: 795/1614 cut-off events. [2023-11-06 23:01:22,717 INFO L125 PetriNetUnfolderBase]: For 934/934 co-relation queries the response was YES. [2023-11-06 23:01:22,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4233 conditions, 1614 events. 795/1614 cut-off events. For 934/934 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9311 event pairs, 270 based on Foata normal form. 14/1511 useless extension candidates. Maximal degree in co-relation 4209. Up to 800 conditions per place. [2023-11-06 23:01:22,729 INFO L140 encePairwiseOnDemand]: 675/691 looper letters, 121 selfloop transitions, 32 changer transitions 0/159 dead transitions. [2023-11-06 23:01:22,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 159 transitions, 1025 flow [2023-11-06 23:01:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:01:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-06 23:01:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2311 transitions. [2023-11-06 23:01:22,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27870236372407137 [2023-11-06 23:01:22,743 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2311 transitions. [2023-11-06 23:01:22,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2311 transitions. [2023-11-06 23:01:22,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:22,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2311 transitions. [2023-11-06 23:01:22,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 192.58333333333334) internal successors, (2311), 12 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 691.0) internal successors, (8983), 13 states have internal predecessors, (8983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,766 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 691.0) internal successors, (8983), 13 states have internal predecessors, (8983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,767 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 516 flow. Second operand 12 states and 2311 transitions. [2023-11-06 23:01:22,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 159 transitions, 1025 flow [2023-11-06 23:01:22,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 159 transitions, 980 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:22,779 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 654 flow [2023-11-06 23:01:22,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=654, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2023-11-06 23:01:22,780 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 7 predicate places. [2023-11-06 23:01:22,781 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 654 flow [2023-11-06 23:01:22,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 183.6153846153846) internal successors, (4774), 26 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:22,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:22,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 23:01:22,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 23:01:22,989 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:01:22,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1039042783, now seen corresponding path program 2 times [2023-11-06 23:01:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:22,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358528211] [2023-11-06 23:01:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:24,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358528211] [2023-11-06 23:01:24,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358528211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:01:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035397822] [2023-11-06 23:01:24,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:01:24,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:24,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:24,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:01:24,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:01:24,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:01:24,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:01:24,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 23:01:24,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:24,476 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:01:24,477 INFO L351 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 [2023-11-06 23:01:24,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:24,491 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 15 [2023-11-06 23:01:24,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:24,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:24,529 INFO L351 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 26 treesize of output 15 [2023-11-06 23:01:24,565 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:01:24,566 INFO L351 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 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-06 23:01:25,047 INFO L351 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 102 treesize of output 85 [2023-11-06 23:01:25,284 INFO L351 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 83 treesize of output 72 [2023-11-06 23:01:25,681 INFO L351 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 93 treesize of output 76 [2023-11-06 23:01:25,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:25,841 INFO L351 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 84 treesize of output 69 [2023-11-06 23:01:25,994 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 23:01:25,995 INFO L351 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 1 case distinctions, treesize of input 87 treesize of output 72 [2023-11-06 23:01:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:26,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:01:26,245 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_458) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_458) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-06 23:01:26,270 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_458) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_458) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 23:01:26,294 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_458) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_458) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2023-11-06 23:01:28,333 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_128| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_128| 1)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_458) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_128| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_128| 1)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_458) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2023-11-06 23:01:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035397822] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:01:28,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:01:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-06 23:01:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776018628] [2023-11-06 23:01:28,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:01:28,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 23:01:28,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:28,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 23:01:28,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=358, Unknown=8, NotChecked=172, Total=650 [2023-11-06 23:01:29,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 691 [2023-11-06 23:01:29,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 654 flow. Second operand has 26 states, 26 states have (on average 183.6153846153846) internal successors, (4774), 26 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:29,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:29,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 691 [2023-11-06 23:01:29,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:32,490 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] [2023-11-06 23:01:34,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 23:01:36,827 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] [2023-11-06 23:01:39,413 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] [2023-11-06 23:01:41,579 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] [2023-11-06 23:01:44,643 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] [2023-11-06 23:01:46,656 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] [2023-11-06 23:01:48,749 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] [2023-11-06 23:01:51,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:01:53,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] [2023-11-06 23:02:00,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 23:02:06,478 INFO L124 PetriNetUnfolderBase]: 1355/2739 cut-off events. [2023-11-06 23:02:06,478 INFO L125 PetriNetUnfolderBase]: For 3046/3052 co-relation queries the response was YES. [2023-11-06 23:02:06,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7886 conditions, 2739 events. 1355/2739 cut-off events. For 3046/3052 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 17684 event pairs, 517 based on Foata normal form. 20/2588 useless extension candidates. Maximal degree in co-relation 7855. Up to 886 conditions per place. [2023-11-06 23:02:06,500 INFO L140 encePairwiseOnDemand]: 670/691 looper letters, 189 selfloop transitions, 97 changer transitions 0/292 dead transitions. [2023-11-06 23:02:06,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 292 transitions, 1976 flow [2023-11-06 23:02:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 23:02:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-06 23:02:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4804 transitions. [2023-11-06 23:02:06,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27808972503617946 [2023-11-06 23:02:06,520 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4804 transitions. [2023-11-06 23:02:06,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4804 transitions. [2023-11-06 23:02:06,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:06,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4804 transitions. [2023-11-06 23:02:06,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 192.16) internal successors, (4804), 25 states have internal predecessors, (4804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 691.0) internal successors, (17966), 26 states have internal predecessors, (17966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,564 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 691.0) internal successors, (17966), 26 states have internal predecessors, (17966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,564 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 654 flow. Second operand 25 states and 4804 transitions. [2023-11-06 23:02:06,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 292 transitions, 1976 flow [2023-11-06 23:02:06,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 292 transitions, 1890 flow, removed 37 selfloop flow, removed 2 redundant places. [2023-11-06 23:02:06,589 INFO L231 Difference]: Finished difference. Result has 146 places, 169 transitions, 1362 flow [2023-11-06 23:02:06,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1362, PETRI_PLACES=146, PETRI_TRANSITIONS=169} [2023-11-06 23:02:06,590 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 40 predicate places. [2023-11-06 23:02:06,590 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 169 transitions, 1362 flow [2023-11-06 23:02:06,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 183.6153846153846) internal successors, (4774), 26 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:06,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:06,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-06 23:02:06,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 23:02:06,797 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)] === [2023-11-06 23:02:06,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1744885421, now seen corresponding path program 1 times [2023-11-06 23:02:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:06,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209406801] [2023-11-06 23:02:06,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:06,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209406801] [2023-11-06 23:02:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209406801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:06,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:02:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415694869] [2023-11-06 23:02:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:06,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:02:06,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:02:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:02:06,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 691 [2023-11-06 23:02:06,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 169 transitions, 1362 flow. Second operand has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:06,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 691 [2023-11-06 23:02:06,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:07,922 INFO L124 PetriNetUnfolderBase]: 1362/2820 cut-off events. [2023-11-06 23:02:07,922 INFO L125 PetriNetUnfolderBase]: For 22283/22317 co-relation queries the response was YES. [2023-11-06 23:02:07,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14135 conditions, 2820 events. 1362/2820 cut-off events. For 22283/22317 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 18620 event pairs, 625 based on Foata normal form. 8/2677 useless extension candidates. Maximal degree in co-relation 14094. Up to 1271 conditions per place. [2023-11-06 23:02:07,961 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 160 selfloop transitions, 3 changer transitions 0/179 dead transitions. [2023-11-06 23:02:07,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 179 transitions, 1782 flow [2023-11-06 23:02:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:02:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:02:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2023-11-06 23:02:07,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331886155330439 [2023-11-06 23:02:07,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 898 transitions. [2023-11-06 23:02:07,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 898 transitions. [2023-11-06 23:02:07,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:07,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 898 transitions. [2023-11-06 23:02:07,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:07,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:07,971 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:07,971 INFO L175 Difference]: Start difference. First operand has 146 places, 169 transitions, 1362 flow. Second operand 3 states and 898 transitions. [2023-11-06 23:02:07,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 179 transitions, 1782 flow [2023-11-06 23:02:08,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 179 transitions, 1586 flow, removed 74 selfloop flow, removed 10 redundant places. [2023-11-06 23:02:08,013 INFO L231 Difference]: Finished difference. Result has 134 places, 164 transitions, 1142 flow [2023-11-06 23:02:08,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=134, PETRI_TRANSITIONS=164} [2023-11-06 23:02:08,015 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 28 predicate places. [2023-11-06 23:02:08,015 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 164 transitions, 1142 flow [2023-11-06 23:02:08,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:08,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:08,016 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:08,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:02:08,016 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:02:08,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2107589623, now seen corresponding path program 1 times [2023-11-06 23:02:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038597473] [2023-11-06 23:02:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:09,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038597473] [2023-11-06 23:02:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038597473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884190354] [2023-11-06 23:02:09,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:09,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:09,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:09,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:09,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:02:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:09,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 23:02:09,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:09,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,603 INFO L351 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 19 treesize of output 9 [2023-11-06 23:02:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:10,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884190354] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:10,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:10,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2023-11-06 23:02:10,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168286550] [2023-11-06 23:02:10,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:10,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 23:02:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:10,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 23:02:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:02:21,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 691 [2023-11-06 23:02:21,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 164 transitions, 1142 flow. Second operand has 17 states, 17 states have (on average 261.3529411764706) internal successors, (4443), 17 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:21,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:21,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 691 [2023-11-06 23:02:21,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:25,078 INFO L124 PetriNetUnfolderBase]: 2009/4083 cut-off events. [2023-11-06 23:02:25,078 INFO L125 PetriNetUnfolderBase]: For 34654/34683 co-relation queries the response was YES. [2023-11-06 23:02:25,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21003 conditions, 4083 events. 2009/4083 cut-off events. For 34654/34683 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 26219 event pairs, 779 based on Foata normal form. 54/3920 useless extension candidates. Maximal degree in co-relation 20965. Up to 1454 conditions per place. [2023-11-06 23:02:25,131 INFO L140 encePairwiseOnDemand]: 678/691 looper letters, 291 selfloop transitions, 54 changer transitions 0/350 dead transitions. [2023-11-06 23:02:25,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 350 transitions, 3425 flow [2023-11-06 23:02:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 23:02:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-06 23:02:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 5919 transitions. [2023-11-06 23:02:25,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38935666359689514 [2023-11-06 23:02:25,144 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 5919 transitions. [2023-11-06 23:02:25,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 5919 transitions. [2023-11-06 23:02:25,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:25,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 5919 transitions. [2023-11-06 23:02:25,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 269.04545454545456) internal successors, (5919), 22 states have internal predecessors, (5919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:25,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 691.0) internal successors, (15893), 23 states have internal predecessors, (15893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:25,180 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 691.0) internal successors, (15893), 23 states have internal predecessors, (15893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:25,180 INFO L175 Difference]: Start difference. First operand has 134 places, 164 transitions, 1142 flow. Second operand 22 states and 5919 transitions. [2023-11-06 23:02:25,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 350 transitions, 3425 flow [2023-11-06 23:02:25,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 350 transitions, 3350 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-11-06 23:02:25,243 INFO L231 Difference]: Finished difference. Result has 159 places, 181 transitions, 1406 flow [2023-11-06 23:02:25,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1406, PETRI_PLACES=159, PETRI_TRANSITIONS=181} [2023-11-06 23:02:25,244 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 53 predicate places. [2023-11-06 23:02:25,244 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 181 transitions, 1406 flow [2023-11-06 23:02:25,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 261.3529411764706) internal successors, (4443), 17 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:25,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:25,246 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-06 23:02:25,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:02:25,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:25,453 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 23:02:25,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1837132340, now seen corresponding path program 2 times [2023-11-06 23:02:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671070661] [2023-11-06 23:02:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:27,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:27,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671070661] [2023-11-06 23:02:27,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671070661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:27,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351923782] [2023-11-06 23:02:27,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:02:27,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:27,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:27,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_206ee47a-1f63-44b0-b7da-762bf60471c0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 23:02:28,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:02:28,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:02:28,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-06 23:02:28,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:28,253 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:02:28,253 INFO L351 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 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-06 23:02:28,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:28,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:28,277 INFO L351 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 26 treesize of output 15 [2023-11-06 23:02:28,350 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:02:28,350 INFO L351 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 [2023-11-06 23:02:28,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:28,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 15 [2023-11-06 23:02:28,999 INFO L351 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 84 treesize of output 75 [2023-11-06 23:02:29,437 INFO L351 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 101 treesize of output 90 [2023-11-06 23:02:30,479 INFO L351 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 122 treesize of output 105 [2023-11-06 23:02:30,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:30,934 INFO L351 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 168 treesize of output 141 [2023-11-06 23:02:31,438 INFO L351 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 186 treesize of output 157 [2023-11-06 23:02:32,983 INFO L351 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 381 treesize of output 314 [2023-11-06 23:02:35,249 INFO L351 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 383 treesize of output 314 [2023-11-06 23:02:36,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:36,452 INFO L351 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 770 treesize of output 655 [2023-11-06 23:02:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:37,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351923782] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:00,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 37 [2023-11-06 23:03:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261017829] [2023-11-06 23:03:00,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:00,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-06 23:03:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:00,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-06 23:03:00,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1161, Unknown=36, NotChecked=0, Total=1482 [2023-11-06 23:03:17,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 691 [2023-11-06 23:03:17,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 181 transitions, 1406 flow. Second operand has 39 states, 39 states have (on average 189.6153846153846) internal successors, (7395), 39 states have internal predecessors, (7395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:17,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:17,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 691 [2023-11-06 23:03:17,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:37,521 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] [2023-11-06 23:03:45,391 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] [2023-11-06 23:03:47,918 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] [2023-11-06 23:03:49,931 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] [2023-11-06 23:03:53,572 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]