./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a 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_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:04:38,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:04:38,782 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:04:38,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:04:38,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:04:38,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:04:38,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:04:38,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:04:38,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:04:38,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:04:38,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:04:38,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:04:38,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:04:38,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:04:38,840 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:04:38,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:04:38,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:04:38,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:04:38,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:04:38,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:04:38,842 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:04:38,842 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:04:38,842 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:04:38,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:04:38,843 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:04:38,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:04:38,844 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:04:38,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:04:38,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:04:38,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:04:38,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:04:38,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:04:38,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:04:38,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:38,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:04:38,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:04:38,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:04:38,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:04:38,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:04:38,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:04:38,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:04:38,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:04:38,849 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_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/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_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d [2024-10-31 22:04:39,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:04:39,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:04:39,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:04:39,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:04:39,214 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:04:39,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/mix027_tso.i Unable to find full path for "g++" [2024-10-31 22:04:41,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:41,626 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:41,626 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/sv-benchmarks/c/pthread-wmm/mix027_tso.i [2024-10-31 22:04:41,651 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/data/e3c62f68c/c87f2848d8824c28a67a695b4fa13d8b/FLAGf4c40da49 [2024-10-31 22:04:41,909 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/data/e3c62f68c/c87f2848d8824c28a67a695b4fa13d8b [2024-10-31 22:04:41,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:41,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:41,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:41,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:41,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:41,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:41" (1/1) ... [2024-10-31 22:04:41,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8bbb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:41, skipping insertion in model container [2024-10-31 22:04:41,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:41" (1/1) ... [2024-10-31 22:04:42,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:42,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:42,573 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:42,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:42,770 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:42,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42 WrapperNode [2024-10-31 22:04:42,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:42,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:42,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:42,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:42,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,858 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2024-10-31 22:04:42,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:42,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:42,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:42,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:42,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,908 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:04:42,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:42,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:42,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:42,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:42,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (1/1) ... [2024-10-31 22:04:42,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:42,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:42,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f80bfb8-8432-4ef0-a1c5-1f6bda4b3d0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:04:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:04:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:04:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:04:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:04:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:04:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-31 22:04:43,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-31 22:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:43,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:43,029 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:04:43,205 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:43,208 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:43,679 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:04:43,680 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:43,997 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:43,998 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:04:44,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:44 BoogieIcfgContainer [2024-10-31 22:04:44,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:44,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:44,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:44,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:44,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:41" (1/3) ... [2024-10-31 22:04:44,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df9a08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:44, skipping insertion in model container [2024-10-31 22:04:44,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:42" (2/3) ... [2024-10-31 22:04:44,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df9a08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:44, skipping insertion in model container [2024-10-31 22:04:44,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:44" (3/3) ... [2024-10-31 22:04:44,019 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2024-10-31 22:04:44,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:44,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:04:44,063 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:04:44,200 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:04:44,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-10-31 22:04:44,316 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-10-31 22:04:44,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:04:44,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-10-31 22:04:44,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-10-31 22:04:44,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-10-31 22:04:44,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:44,345 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5d0f3e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:44,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-31 22:04:44,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:04:44,352 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-10-31 22:04:44,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:04:44,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:44,353 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:04:44,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:44,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash -528324660, now seen corresponding path program 1 times [2024-10-31 22:04:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:44,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202791647] [2024-10-31 22:04:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:44,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:44,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202791647] [2024-10-31 22:04:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202791647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:04:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314056875] [2024-10-31 22:04:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:44,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:45,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:45,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-10-31 22:04:45,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:45,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:45,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-10-31 22:04:45,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:46,472 INFO L124 PetriNetUnfolderBase]: 2754/4562 cut-off events. [2024-10-31 22:04:46,473 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-31 22:04:46,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8501 conditions, 4562 events. 2754/4562 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 32045 event pairs, 492 based on Foata normal form. 216/4705 useless extension candidates. Maximal degree in co-relation 8489. Up to 3064 conditions per place. [2024-10-31 22:04:46,521 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 39 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-10-31 22:04:46,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 232 flow [2024-10-31 22:04:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:04:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-10-31 22:04:46,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2024-10-31 22:04:46,537 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 123 transitions. [2024-10-31 22:04:46,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 232 flow [2024-10-31 22:04:46,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-31 22:04:46,550 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-10-31 22:04:46,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-10-31 22:04:46,557 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-10-31 22:04:46,557 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-10-31 22:04:46,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:46,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:46,558 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:46,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:04:46,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1198152217, now seen corresponding path program 1 times [2024-10-31 22:04:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:46,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476139450] [2024-10-31 22:04:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:46,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:46,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476139450] [2024-10-31 22:04:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476139450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:46,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:04:46,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741005399] [2024-10-31 22:04:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:46,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:46,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:46,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:46,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:46,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2024-10-31 22:04:46,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:46,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:46,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2024-10-31 22:04:46,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:47,712 INFO L124 PetriNetUnfolderBase]: 2457/4097 cut-off events. [2024-10-31 22:04:47,713 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-10-31 22:04:47,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7869 conditions, 4097 events. 2457/4097 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 28102 event pairs, 2457 based on Foata normal form. 108/4012 useless extension candidates. Maximal degree in co-relation 7859. Up to 3424 conditions per place. [2024-10-31 22:04:47,743 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 22 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-10-31 22:04:47,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 148 flow [2024-10-31 22:04:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:04:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-10-31 22:04:47,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654 [2024-10-31 22:04:47,746 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 97 transitions. [2024-10-31 22:04:47,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 148 flow [2024-10-31 22:04:47,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:04:47,748 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2024-10-31 22:04:47,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-10-31 22:04:47,749 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2024-10-31 22:04:47,749 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2024-10-31 22:04:47,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:47,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:47,750 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:47,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:04:47,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1198150961, now seen corresponding path program 1 times [2024-10-31 22:04:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:47,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797382722] [2024-10-31 22:04:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797382722] [2024-10-31 22:04:48,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797382722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:48,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:48,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:04:48,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898301868] [2024-10-31 22:04:48,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:48,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:04:48,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:48,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:04:48,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:48,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 54 [2024-10-31 22:04:48,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:48,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:48,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 54 [2024-10-31 22:04:48,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:52,875 INFO L124 PetriNetUnfolderBase]: 12252/17696 cut-off events. [2024-10-31 22:04:52,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:04:52,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34407 conditions, 17696 events. 12252/17696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 118394 event pairs, 2039 based on Foata normal form. 0/17314 useless extension candidates. Maximal degree in co-relation 34401. Up to 7327 conditions per place. [2024-10-31 22:04:53,008 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 44 selfloop transitions, 11 changer transitions 98/167 dead transitions. [2024-10-31 22:04:53,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 167 transitions, 650 flow [2024-10-31 22:04:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:04:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-31 22:04:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 384 transitions. [2024-10-31 22:04:53,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-31 22:04:53,013 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 12 states and 384 transitions. [2024-10-31 22:04:53,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 167 transitions, 650 flow [2024-10-31 22:04:53,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 167 transitions, 649 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:04:53,023 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 237 flow [2024-10-31 22:04:53,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=237, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2024-10-31 22:04:53,026 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2024-10-31 22:04:53,026 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 237 flow [2024-10-31 22:04:53,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:53,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:53,027 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:53,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:04:53,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:53,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash -71015674, now seen corresponding path program 1 times [2024-10-31 22:04:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:53,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171662351] [2024-10-31 22:04:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:53,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:54,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:54,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171662351] [2024-10-31 22:04:54,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171662351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:54,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:54,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:04:54,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719841739] [2024-10-31 22:04:54,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:54,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:04:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:54,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:04:54,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:04:54,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2024-10-31 22:04:54,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:54,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:54,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2024-10-31 22:04:54,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:57,747 INFO L124 PetriNetUnfolderBase]: 9400/14272 cut-off events. [2024-10-31 22:04:57,747 INFO L125 PetriNetUnfolderBase]: For 29649/31912 co-relation queries the response was YES. [2024-10-31 22:04:57,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53340 conditions, 14272 events. 9400/14272 cut-off events. For 29649/31912 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 99916 event pairs, 4706 based on Foata normal form. 395/13626 useless extension candidates. Maximal degree in co-relation 53322. Up to 8868 conditions per place. [2024-10-31 22:04:57,920 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 45 selfloop transitions, 4 changer transitions 51/121 dead transitions. [2024-10-31 22:04:57,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 121 transitions, 833 flow [2024-10-31 22:04:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:04:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:04:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2024-10-31 22:04:57,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-10-31 22:04:57,923 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 237 flow. Second operand 7 states and 237 transitions. [2024-10-31 22:04:57,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 121 transitions, 833 flow [2024-10-31 22:04:58,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 121 transitions, 761 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-10-31 22:04:58,641 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 267 flow [2024-10-31 22:04:58,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2024-10-31 22:04:58,642 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2024-10-31 22:04:58,643 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 267 flow [2024-10-31 22:04:58,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:58,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:58,643 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:58,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:04:58,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:58,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1229323736, now seen corresponding path program 1 times [2024-10-31 22:04:58,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:58,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895825434] [2024-10-31 22:04:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895825434] [2024-10-31 22:04:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895825434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:59,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:04:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304788197] [2024-10-31 22:04:59,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:59,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:04:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:59,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:04:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:04:59,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-10-31 22:04:59,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 267 flow. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:04:59,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:59,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-10-31 22:04:59,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:04,833 INFO L124 PetriNetUnfolderBase]: 14596/21089 cut-off events. [2024-10-31 22:05:04,833 INFO L125 PetriNetUnfolderBase]: For 43426/43426 co-relation queries the response was YES. [2024-10-31 22:05:04,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79584 conditions, 21089 events. 14596/21089 cut-off events. For 43426/43426 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 137627 event pairs, 2833 based on Foata normal form. 454/21535 useless extension candidates. Maximal degree in co-relation 79564. Up to 12944 conditions per place. [2024-10-31 22:05:05,028 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 84 selfloop transitions, 31 changer transitions 99/227 dead transitions. [2024-10-31 22:05:05,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 227 transitions, 1712 flow [2024-10-31 22:05:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:05:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-31 22:05:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 368 transitions. [2024-10-31 22:05:05,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6195286195286195 [2024-10-31 22:05:05,033 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 267 flow. Second operand 11 states and 368 transitions. [2024-10-31 22:05:05,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 227 transitions, 1712 flow [2024-10-31 22:05:05,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 227 transitions, 1678 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-10-31 22:05:05,686 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 642 flow [2024-10-31 22:05:05,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=642, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2024-10-31 22:05:05,687 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2024-10-31 22:05:05,688 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 642 flow [2024-10-31 22:05:05,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:05,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:05,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:05,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:05:05,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:05:05,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:05,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1116046630, now seen corresponding path program 1 times [2024-10-31 22:05:05,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:05,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741578891] [2024-10-31 22:05:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:05,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:06,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741578891] [2024-10-31 22:05:06,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741578891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:06,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:06,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:05:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827611308] [2024-10-31 22:05:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:06,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:05:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:05:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:05:06,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2024-10-31 22:05:06,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 642 flow. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:06,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:06,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2024-10-31 22:05:06,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:08,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L754-->L761: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_43 256) 0))))) (and (= (ite (= (mod (ite .cse0 0 v_~x$r_buff0_thd1~0_22) 256) 0) 0 1) v_~x$r_buff0_thd1~0_21) (= v_~x$r_buff1_thd1~0_19 (ite (= (mod (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20) 256) 0) 0 1)) (= v_~x$w_buff1_used~0_42 (ite (= (mod (ite (or .cse3 .cse0) 0 v_~x$w_buff1_used~0_43) 256) 0) 0 1)) (= v_~x$w_buff0_used~0_51 (ite (= (mod (ite .cse4 0 v_~x$w_buff0_used~0_52) 256) 0) 0 1)) (= (ite .cse4 v_~x$w_buff0~0_12 (ite .cse3 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][36], [60#true, 32#L824true, 66#true, Black: 124#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff0_thd0~0 256)) (<= (mod ~x$r_buff0_thd0~0 256) 0)), Black: 137#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0) (not (= 2 ~z~0))) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 135#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff0_thd0~0 256)) (<= (mod ~x$r_buff0_thd0~0 256) 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 129#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff0_thd0~0 256)) (<= (mod ~x$r_buff0_thd0~0 256) 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 126#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 125#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0) (not (= 2 ~z~0))) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))))), 147#true, 48#L859true, 19#L791true, Black: 77#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0) (not (= 2 ~z~0))) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))))), 120#true, Black: 76#(= ~__unbuffered_p3_EAX~0 0), Black: 87#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0) (not (= 2 ~z~0))) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 73#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 62#true, 36#L761true, 38#L804true, Black: 112#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#true, Black: 110#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), 64#true]) [2024-10-31 22:05:08,276 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-31 22:05:08,277 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-31 22:05:08,277 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-31 22:05:08,277 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event