./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.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_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/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_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/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_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/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 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:52,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:52,203 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 21:14:52,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:52,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:52,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:52,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:52,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:52,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:52,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:52,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:52,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:52,245 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:52,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:52,247 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:52,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:52,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:52,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:52,249 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:14:52,250 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:14:52,251 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:14:52,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:52,252 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:14:52,253 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:14:52,254 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:52,254 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:52,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:52,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:52,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:52,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:52,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:52,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:52,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:52,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:14:52,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:52,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:52,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:52,262 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:52,262 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_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/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_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/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 -> 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa [2023-11-06 21:14:52,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:52,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:52,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:52,663 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:52,663 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:52,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 21:14:56,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:56,691 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:56,691 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/sv-benchmarks/c/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 21:14:56,728 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/data/d9150d7d4/d18b1f104a5040929dfc2fedce9d0cfc/FLAG71617a43b [2023-11-06 21:14:56,749 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/data/d9150d7d4/d18b1f104a5040929dfc2fedce9d0cfc [2023-11-06 21:14:56,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:56,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:56,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:56,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:56,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:56,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:56" (1/1) ... [2023-11-06 21:14:56,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0d3374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:56, skipping insertion in model container [2023-11-06 21:14:56,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:56" (1/1) ... [2023-11-06 21:14:56,871 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:57,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:57,377 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:57,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:57,544 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:14:57,544 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:14:57,554 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:57,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57 WrapperNode [2023-11-06 21:14:57,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:57,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:57,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:57,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:57,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,626 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-06 21:14:57,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:57,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:57,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:57,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:57,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:57,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:57,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:57,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:57,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (1/1) ... [2023-11-06 21:14:57,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:57,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:57,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:57,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89105c3c-8cc1-4eb8-a7e7-a9e7e046fe07/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:14:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:14:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:14:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:14:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:14:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:14:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:14:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:14:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:14:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 21:14:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 21:14:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:14:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:57,844 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 21:14:58,093 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:58,096 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:58,565 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:58,847 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:58,848 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:14:58,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:58 BoogieIcfgContainer [2023-11-06 21:14:58,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:58,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:58,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:58,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:58,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:56" (1/3) ... [2023-11-06 21:14:58,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293e13bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:58, skipping insertion in model container [2023-11-06 21:14:58,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:57" (2/3) ... [2023-11-06 21:14:58,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293e13bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:58, skipping insertion in model container [2023-11-06 21:14:58,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:58" (3/3) ... [2023-11-06 21:14:58,861 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 21:14:58,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:58,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 21:14:58,884 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:14:58,999 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:14:59,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 152 transitions, 320 flow [2023-11-06 21:14:59,131 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2023-11-06 21:14:59,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:59,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 3/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-06 21:14:59,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 152 transitions, 320 flow [2023-11-06 21:14:59,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 148 transitions, 308 flow [2023-11-06 21:14:59,148 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:14:59,158 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 148 transitions, 308 flow [2023-11-06 21:14:59,161 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 148 transitions, 308 flow [2023-11-06 21:14:59,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 148 transitions, 308 flow [2023-11-06 21:14:59,202 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2023-11-06 21:14:59,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:59,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 3/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-06 21:14:59,208 INFO L119 LiptonReduction]: Number of co-enabled transitions 4214 [2023-11-06 21:15:06,158 INFO L134 LiptonReduction]: Checked pairs total: 12344 [2023-11-06 21:15:06,158 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-11-06 21:15:06,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:15:06,186 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;@20642a2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:15:06,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 21:15:06,188 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:15:06,189 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 21:15:06,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:06,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:06,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:15:06,191 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:06,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash 652, now seen corresponding path program 1 times [2023-11-06 21:15:06,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271623092] [2023-11-06 21:15:06,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:06,358 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 21:15:06,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271623092] [2023-11-06 21:15:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271623092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:06,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:06,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:15:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847753786] [2023-11-06 21:15:06,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:06,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:15:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:15:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:15:06,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 291 [2023-11-06 21:15:06,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 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 21:15:06,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:06,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 291 [2023-11-06 21:15:06,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:09,310 INFO L124 PetriNetUnfolderBase]: 8719/11889 cut-off events. [2023-11-06 21:15:09,310 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-06 21:15:09,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23837 conditions, 11889 events. 8719/11889 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 63774 event pairs, 8719 based on Foata normal form. 0/10380 useless extension candidates. Maximal degree in co-relation 23825. Up to 11731 conditions per place. [2023-11-06 21:15:09,469 INFO L140 encePairwiseOnDemand]: 282/291 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-06 21:15:09,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-11-06 21:15:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:15:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:15:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-06 21:15:09,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5309278350515464 [2023-11-06 21:15:09,498 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-06 21:15:09,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-06 21:15:09,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:09,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-06 21:15:09,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 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 21:15:09,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 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 21:15:09,523 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 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 21:15:09,525 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 309 transitions. [2023-11-06 21:15:09,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-11-06 21:15:09,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 21:15:09,541 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-11-06 21:15:09,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-06 21:15:09,548 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-06 21:15:09,549 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-11-06 21:15:09,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 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 21:15:09,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:09,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 21:15:09,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:15:09,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:09,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash 640939, now seen corresponding path program 1 times [2023-11-06 21:15:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382609808] [2023-11-06 21:15:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:09,934 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 21:15:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:09,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382609808] [2023-11-06 21:15:09,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382609808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:09,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:09,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728218777] [2023-11-06 21:15:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:09,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:09,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:09,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 291 [2023-11-06 21:15:09,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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 21:15:09,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:09,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 291 [2023-11-06 21:15:09,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:12,068 INFO L124 PetriNetUnfolderBase]: 6855/9898 cut-off events. [2023-11-06 21:15:12,069 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:12,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19335 conditions, 9898 events. 6855/9898 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 61817 event pairs, 1263 based on Foata normal form. 0/9233 useless extension candidates. Maximal degree in co-relation 19332. Up to 7399 conditions per place. [2023-11-06 21:15:12,186 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-11-06 21:15:12,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-11-06 21:15:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-11-06 21:15:12,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211912943871707 [2023-11-06 21:15:12,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-11-06 21:15:12,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-11-06 21:15:12,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:12,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-11-06 21:15:12,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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 21:15:12,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 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 21:15:12,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 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 21:15:12,212 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 455 transitions. [2023-11-06 21:15:12,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-11-06 21:15:12,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:15:12,215 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-11-06 21:15:12,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-06 21:15:12,219 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-11-06 21:15:12,219 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-11-06 21:15:12,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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 21:15:12,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:12,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:12,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:15:12,229 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:12,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash 668078519, now seen corresponding path program 1 times [2023-11-06 21:15:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:12,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362314945] [2023-11-06 21:15:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:12,673 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 21:15:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362314945] [2023-11-06 21:15:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362314945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:12,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:12,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741581296] [2023-11-06 21:15:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:12,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:12,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:12,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:12,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2023-11-06 21:15:12,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 21:15:12,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:12,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2023-11-06 21:15:12,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:18,378 INFO L124 PetriNetUnfolderBase]: 31165/41738 cut-off events. [2023-11-06 21:15:18,379 INFO L125 PetriNetUnfolderBase]: For 1931/1931 co-relation queries the response was YES. [2023-11-06 21:15:18,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85997 conditions, 41738 events. 31165/41738 cut-off events. For 1931/1931 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 230924 event pairs, 11139 based on Foata normal form. 0/40878 useless extension candidates. Maximal degree in co-relation 85993. Up to 23916 conditions per place. [2023-11-06 21:15:18,669 INFO L140 encePairwiseOnDemand]: 280/291 looper letters, 47 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2023-11-06 21:15:18,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 246 flow [2023-11-06 21:15:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-11-06 21:15:18,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48911798396334477 [2023-11-06 21:15:18,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-11-06 21:15:18,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-11-06 21:15:18,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:18,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-11-06 21:15:18,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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 21:15:18,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 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 21:15:18,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 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 21:15:18,679 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 427 transitions. [2023-11-06 21:15:18,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 246 flow [2023-11-06 21:15:18,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:18,683 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2023-11-06 21:15:18,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-11-06 21:15:18,685 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-11-06 21:15:18,686 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2023-11-06 21:15:18,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 21:15:18,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:18,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:18,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:15:18,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:18,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -764403525, now seen corresponding path program 1 times [2023-11-06 21:15:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:18,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809751656] [2023-11-06 21:15:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:18,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:18,967 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 21:15:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809751656] [2023-11-06 21:15:18,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809751656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:18,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713308692] [2023-11-06 21:15:18,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:18,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:18,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2023-11-06 21:15:18,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 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 21:15:18,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:19,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2023-11-06 21:15:19,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:23,710 INFO L124 PetriNetUnfolderBase]: 29699/39766 cut-off events. [2023-11-06 21:15:23,710 INFO L125 PetriNetUnfolderBase]: For 19036/19036 co-relation queries the response was YES. [2023-11-06 21:15:23,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103289 conditions, 39766 events. 29699/39766 cut-off events. For 19036/19036 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 217779 event pairs, 6005 based on Foata normal form. 260/40026 useless extension candidates. Maximal degree in co-relation 103284. Up to 17001 conditions per place. [2023-11-06 21:15:24,032 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 70 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2023-11-06 21:15:24,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 428 flow [2023-11-06 21:15:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-11-06 21:15:24,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853951890034364 [2023-11-06 21:15:24,037 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-11-06 21:15:24,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-11-06 21:15:24,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:24,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-11-06 21:15:24,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 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 21:15:24,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 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 21:15:24,045 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 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 21:15:24,046 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 565 transitions. [2023-11-06 21:15:24,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 428 flow [2023-11-06 21:15:24,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 80 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:24,169 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 206 flow [2023-11-06 21:15:24,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-11-06 21:15:24,172 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-11-06 21:15:24,172 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 206 flow [2023-11-06 21:15:24,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 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 21:15:24,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:24,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:24,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:15:24,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:24,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:24,175 INFO L85 PathProgramCache]: Analyzing trace with hash -764401422, now seen corresponding path program 1 times [2023-11-06 21:15:24,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:24,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135582149] [2023-11-06 21:15:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:25,088 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 21:15:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135582149] [2023-11-06 21:15:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135582149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:25,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:15:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487888589] [2023-11-06 21:15:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:25,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:15:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:15:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:25,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 291 [2023-11-06 21:15:25,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 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 21:15:25,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:25,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 291 [2023-11-06 21:15:25,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:27,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 63#L3true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L826true, Black: 172#true, 65#L809true, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:27,808 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,808 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,808 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,808 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][61], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 63#L3true, 186#true, 117#L829true, 65#L809true, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse, 178#true]) [2023-11-06 21:15:27,809 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,809 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,809 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,809 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L887-->L871-2: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_#valid_196| (store |v_#valid_197| |v_ULTIMATE.start_main_~#t209~0#1.base_42| 0)) (= |v_ULTIMATE.start_main_#res#1_28| 0) (not (= (mod v_~main$tmp_guard1~0_26 256) 0))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, #valid=|v_#valid_197|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_36|, #valid=|v_#valid_196|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base][55], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 145#$Ultimate##0true, 192#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 125#L871-2true, 65#L809true, Black: 172#true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:27,810 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,811 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,811 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,811 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [139#L887true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 145#$Ultimate##0true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), Black: 172#true, 65#L809true, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:27,812 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,812 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,812 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:27,812 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:28,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L887-->L871-2: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_#valid_196| (store |v_#valid_197| |v_ULTIMATE.start_main_~#t209~0#1.base_42| 0)) (= |v_ULTIMATE.start_main_#res#1_28| 0) (not (= (mod v_~main$tmp_guard1~0_26 256) 0))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, #valid=|v_#valid_197|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_36|, #valid=|v_#valid_196|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base][55], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 192#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 125#L871-2true, 119#L826true, Black: 172#true, 65#L809true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:28,131 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,131 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,131 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,131 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [139#L887true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L826true, Black: 172#true, 65#L809true, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:28,132 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,132 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,132 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,132 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][61], [139#L887true, 111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 186#true, 117#L829true, 65#L809true, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse, 178#true]) [2023-11-06 21:15:28,133 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,133 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,133 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,133 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 63#L3true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L826true, Black: 172#true, 65#L809true, 136#P0EXITtrue, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:28,134 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,135 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,135 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,135 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][61], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 63#L3true, 186#true, 117#L829true, 65#L809true, 136#P0EXITtrue, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, 178#true, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:28,135 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,135 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,136 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,136 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L887-->L871-2: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_#valid_196| (store |v_#valid_197| |v_ULTIMATE.start_main_~#t209~0#1.base_42| 0)) (= |v_ULTIMATE.start_main_#res#1_28| 0) (not (= (mod v_~main$tmp_guard1~0_26 256) 0))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, #valid=|v_#valid_197|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_36|, #valid=|v_#valid_196|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base][55], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 145#$Ultimate##0true, 192#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 125#L871-2true, Black: 172#true, 65#L809true, 136#P0EXITtrue, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:28,137 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,137 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,138 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,138 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [139#L887true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 145#$Ultimate##0true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 136#P0EXITtrue, Black: 172#true, 65#L809true, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:28,139 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,139 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,139 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,139 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:28,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L887-->L871-2: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_#valid_196| (store |v_#valid_197| |v_ULTIMATE.start_main_~#t209~0#1.base_42| 0)) (= |v_ULTIMATE.start_main_#res#1_28| 0) (not (= (mod v_~main$tmp_guard1~0_26 256) 0))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, #valid=|v_#valid_197|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_36|, #valid=|v_#valid_196|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base][55], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 192#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 125#L871-2true, 119#L826true, Black: 172#true, 65#L809true, 136#P0EXITtrue, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:28,706 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,706 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,706 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,706 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [139#L887true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L826true, Black: 172#true, 65#L809true, 136#P0EXITtrue, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-06 21:15:28,706 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,706 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,706 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,707 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][61], [139#L887true, 111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 186#true, 117#L829true, 65#L809true, 136#P0EXITtrue, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 178#true]) [2023-11-06 21:15:28,707 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,707 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,707 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:28,707 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:29,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([546] $Ultimate##0-->L783: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= 2 v_~x~0_7) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0][60], [130#L806true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 80#P3EXITtrue, 186#true, 57#L766true, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 106#ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, 92#L783true, P2Thread1of1ForFork1InUse, 178#true]) [2023-11-06 21:15:29,213 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 21:15:29,213 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:15:29,213 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:15:29,214 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:15:30,447 INFO L124 PetriNetUnfolderBase]: 22680/31858 cut-off events. [2023-11-06 21:15:30,447 INFO L125 PetriNetUnfolderBase]: For 18827/20225 co-relation queries the response was YES. [2023-11-06 21:15:30,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82154 conditions, 31858 events. 22680/31858 cut-off events. For 18827/20225 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 198480 event pairs, 3101 based on Foata normal form. 1714/32370 useless extension candidates. Maximal degree in co-relation 82147. Up to 19909 conditions per place. [2023-11-06 21:15:30,710 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 64 selfloop transitions, 7 changer transitions 24/105 dead transitions. [2023-11-06 21:15:30,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 105 transitions, 602 flow [2023-11-06 21:15:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:15:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:15:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2023-11-06 21:15:30,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4413352970054001 [2023-11-06 21:15:30,717 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 899 transitions. [2023-11-06 21:15:30,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 899 transitions. [2023-11-06 21:15:30,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:30,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 899 transitions. [2023-11-06 21:15:30,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 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 21:15:30,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 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 21:15:30,732 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 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 21:15:30,732 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 206 flow. Second operand 7 states and 899 transitions. [2023-11-06 21:15:30,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 105 transitions, 602 flow [2023-11-06 21:15:31,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 105 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:31,113 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 231 flow [2023-11-06 21:15:31,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-06 21:15:31,115 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2023-11-06 21:15:31,115 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 231 flow [2023-11-06 21:15:31,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 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 21:15:31,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:31,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:31,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:15:31,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:31,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:31,117 INFO L85 PathProgramCache]: Analyzing trace with hash -201701862, now seen corresponding path program 1 times [2023-11-06 21:15:31,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417008354] [2023-11-06 21:15:31,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:31,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:31,967 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 21:15:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417008354] [2023-11-06 21:15:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417008354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:31,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:31,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:15:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110069057] [2023-11-06 21:15:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:31,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:15:31,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:31,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:15:31,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:32,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 291 [2023-11-06 21:15:32,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 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 21:15:32,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:32,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 291 [2023-11-06 21:15:32,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:35,574 INFO L124 PetriNetUnfolderBase]: 15869/22260 cut-off events. [2023-11-06 21:15:35,574 INFO L125 PetriNetUnfolderBase]: For 19864/20592 co-relation queries the response was YES. [2023-11-06 21:15:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59503 conditions, 22260 events. 15869/22260 cut-off events. For 19864/20592 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 133265 event pairs, 5036 based on Foata normal form. 1056/22318 useless extension candidates. Maximal degree in co-relation 59493. Up to 15732 conditions per place. [2023-11-06 21:15:35,742 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 46 selfloop transitions, 4 changer transitions 20/83 dead transitions. [2023-11-06 21:15:35,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 491 flow [2023-11-06 21:15:35,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:15:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:15:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-11-06 21:15:35,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261168384879725 [2023-11-06 21:15:35,747 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-11-06 21:15:35,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-11-06 21:15:35,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:35,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-11-06 21:15:35,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:35,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 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 21:15:35,758 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 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 21:15:35,759 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 231 flow. Second operand 7 states and 868 transitions. [2023-11-06 21:15:35,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 491 flow [2023-11-06 21:15:35,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 477 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-06 21:15:35,890 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 197 flow [2023-11-06 21:15:35,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-11-06 21:15:35,891 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-11-06 21:15:35,891 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 197 flow [2023-11-06 21:15:35,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 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 21:15:35,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:35,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:35,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:15:35,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:35,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:35,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1957883382, now seen corresponding path program 1 times [2023-11-06 21:15:35,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:35,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763067918] [2023-11-06 21:15:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:35,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:36,090 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 21:15:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:36,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763067918] [2023-11-06 21:15:36,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763067918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:36,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:36,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816024433] [2023-11-06 21:15:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:36,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:36,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:36,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:36,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:36,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2023-11-06 21:15:36,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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 21:15:36,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:36,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2023-11-06 21:15:36,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:38,879 INFO L124 PetriNetUnfolderBase]: 17095/23194 cut-off events. [2023-11-06 21:15:38,879 INFO L125 PetriNetUnfolderBase]: For 16909/16909 co-relation queries the response was YES. [2023-11-06 21:15:38,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63986 conditions, 23194 events. 17095/23194 cut-off events. For 16909/16909 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 122824 event pairs, 2719 based on Foata normal form. 32/23226 useless extension candidates. Maximal degree in co-relation 63976. Up to 13129 conditions per place. [2023-11-06 21:15:39,013 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 65 selfloop transitions, 19 changer transitions 0/84 dead transitions. [2023-11-06 21:15:39,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 510 flow [2023-11-06 21:15:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 567 transitions. [2023-11-06 21:15:39,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48711340206185566 [2023-11-06 21:15:39,017 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 567 transitions. [2023-11-06 21:15:39,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 567 transitions. [2023-11-06 21:15:39,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:39,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 567 transitions. [2023-11-06 21:15:39,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 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 21:15:39,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 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 21:15:39,023 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 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 21:15:39,023 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 197 flow. Second operand 4 states and 567 transitions. [2023-11-06 21:15:39,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 510 flow [2023-11-06 21:15:39,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 495 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 21:15:39,059 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 299 flow [2023-11-06 21:15:39,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-11-06 21:15:39,060 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2023-11-06 21:15:39,061 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 299 flow [2023-11-06 21:15:39,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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 21:15:39,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:39,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:39,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:15:39,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:39,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash -494658592, now seen corresponding path program 1 times [2023-11-06 21:15:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:39,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58577597] [2023-11-06 21:15:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:39,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:39,215 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 21:15:39,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:39,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58577597] [2023-11-06 21:15:39,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58577597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:39,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:39,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:39,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623503658] [2023-11-06 21:15:39,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:39,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:39,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:39,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:39,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:39,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 291 [2023-11-06 21:15:39,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 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 21:15:39,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:39,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 291 [2023-11-06 21:15:39,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:41,549 INFO L124 PetriNetUnfolderBase]: 10478/15605 cut-off events. [2023-11-06 21:15:41,549 INFO L125 PetriNetUnfolderBase]: For 15930/16996 co-relation queries the response was YES. [2023-11-06 21:15:41,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42499 conditions, 15605 events. 10478/15605 cut-off events. For 15930/16996 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 101342 event pairs, 1659 based on Foata normal form. 1660/16806 useless extension candidates. Maximal degree in co-relation 42487. Up to 9162 conditions per place. [2023-11-06 21:15:41,659 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 88 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2023-11-06 21:15:41,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 115 transitions, 796 flow [2023-11-06 21:15:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:15:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-11-06 21:15:41,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824742268041237 [2023-11-06 21:15:41,668 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-11-06 21:15:41,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-11-06 21:15:41,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:41,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-11-06 21:15:41,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 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 21:15:41,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 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 21:15:41,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 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 21:15:41,677 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 299 flow. Second operand 5 states and 702 transitions. [2023-11-06 21:15:41,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 115 transitions, 796 flow [2023-11-06 21:15:41,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 796 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:15:41,710 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 374 flow [2023-11-06 21:15:41,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-11-06 21:15:41,714 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-11-06 21:15:41,714 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 374 flow [2023-11-06 21:15:41,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 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 21:15:41,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:41,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:41,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:15:41,716 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:41,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2080381509, now seen corresponding path program 1 times [2023-11-06 21:15:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:41,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928584872] [2023-11-06 21:15:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:41,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:41,964 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 21:15:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928584872] [2023-11-06 21:15:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928584872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950422547] [2023-11-06 21:15:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:41,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:41,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:41,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:41,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-11-06 21:15:41,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 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 21:15:41,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:41,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-11-06 21:15:41,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:45,639 INFO L124 PetriNetUnfolderBase]: 18278/25788 cut-off events. [2023-11-06 21:15:45,639 INFO L125 PetriNetUnfolderBase]: For 56833/56833 co-relation queries the response was YES. [2023-11-06 21:15:45,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95683 conditions, 25788 events. 18278/25788 cut-off events. For 56833/56833 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 151235 event pairs, 1001 based on Foata normal form. 192/25980 useless extension candidates. Maximal degree in co-relation 95667. Up to 11323 conditions per place. [2023-11-06 21:15:45,782 INFO L140 encePairwiseOnDemand]: 280/291 looper letters, 87 selfloop transitions, 38 changer transitions 18/143 dead transitions. [2023-11-06 21:15:45,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 143 transitions, 1147 flow [2023-11-06 21:15:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:15:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-11-06 21:15:45,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735395189003436 [2023-11-06 21:15:45,786 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-11-06 21:15:45,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-11-06 21:15:45,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:45,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-11-06 21:15:45,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 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 21:15:45,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 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 21:15:45,792 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 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 21:15:45,792 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 374 flow. Second operand 5 states and 689 transitions. [2023-11-06 21:15:45,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 143 transitions, 1147 flow [2023-11-06 21:15:46,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 143 transitions, 1132 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:46,003 INFO L231 Difference]: Finished difference. Result has 67 places, 75 transitions, 683 flow [2023-11-06 21:15:46,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=683, PETRI_PLACES=67, PETRI_TRANSITIONS=75} [2023-11-06 21:15:46,004 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2023-11-06 21:15:46,004 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 683 flow [2023-11-06 21:15:46,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 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 21:15:46,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:46,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:46,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:15:46,006 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:46,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1886998350, now seen corresponding path program 1 times [2023-11-06 21:15:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:46,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11244316] [2023-11-06 21:15:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:46,207 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 21:15:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:46,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11244316] [2023-11-06 21:15:46,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11244316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:46,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22406118] [2023-11-06 21:15:46,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:46,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:46,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:46,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2023-11-06 21:15:46,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 683 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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 21:15:46,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:46,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2023-11-06 21:15:46,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:49,920 INFO L124 PetriNetUnfolderBase]: 18763/26838 cut-off events. [2023-11-06 21:15:49,920 INFO L125 PetriNetUnfolderBase]: For 90521/90521 co-relation queries the response was YES. [2023-11-06 21:15:50,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108429 conditions, 26838 events. 18763/26838 cut-off events. For 90521/90521 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 160731 event pairs, 5166 based on Foata normal form. 168/27006 useless extension candidates. Maximal degree in co-relation 108410. Up to 11880 conditions per place. [2023-11-06 21:15:50,102 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 96 selfloop transitions, 36 changer transitions 7/139 dead transitions. [2023-11-06 21:15:50,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 139 transitions, 1379 flow [2023-11-06 21:15:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-11-06 21:15:50,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888316151202749 [2023-11-06 21:15:50,105 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-11-06 21:15:50,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-11-06 21:15:50,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:50,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-11-06 21:15:50,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 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 21:15:50,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 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 21:15:50,113 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 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 21:15:50,113 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 683 flow. Second operand 4 states and 569 transitions. [2023-11-06 21:15:50,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 139 transitions, 1379 flow [2023-11-06 21:15:50,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 139 transitions, 1373 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:50,800 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 973 flow [2023-11-06 21:15:50,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=973, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2023-11-06 21:15:50,801 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2023-11-06 21:15:50,802 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 84 transitions, 973 flow [2023-11-06 21:15:50,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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 21:15:50,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:50,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:50,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:15:50,803 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:50,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1290134333, now seen corresponding path program 1 times [2023-11-06 21:15:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:50,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145223802] [2023-11-06 21:15:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:51,047 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 21:15:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:51,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145223802] [2023-11-06 21:15:51,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145223802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:51,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:51,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:15:51,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642133270] [2023-11-06 21:15:51,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:51,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:51,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:51,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:51,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 291 [2023-11-06 21:15:51,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 84 transitions, 973 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 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 21:15:51,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:51,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 291 [2023-11-06 21:15:51,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:53,372 INFO L124 PetriNetUnfolderBase]: 9664/15232 cut-off events. [2023-11-06 21:15:53,372 INFO L125 PetriNetUnfolderBase]: For 44942/46211 co-relation queries the response was YES. [2023-11-06 21:15:53,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56900 conditions, 15232 events. 9664/15232 cut-off events. For 44942/46211 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 106916 event pairs, 1219 based on Foata normal form. 1767/16740 useless extension candidates. Maximal degree in co-relation 56879. Up to 5535 conditions per place. [2023-11-06 21:15:53,465 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 153 selfloop transitions, 14 changer transitions 7/209 dead transitions. [2023-11-06 21:15:53,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 209 transitions, 2507 flow [2023-11-06 21:15:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:15:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:15:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2023-11-06 21:15:53,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48396334478808706 [2023-11-06 21:15:53,469 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 845 transitions. [2023-11-06 21:15:53,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions. [2023-11-06 21:15:53,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:53,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions. [2023-11-06 21:15:53,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 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 21:15:53,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 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 21:15:53,477 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 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 21:15:53,477 INFO L175 Difference]: Start difference. First operand has 70 places, 84 transitions, 973 flow. Second operand 6 states and 845 transitions. [2023-11-06 21:15:53,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 209 transitions, 2507 flow [2023-11-06 21:15:53,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 209 transitions, 2483 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-06 21:15:53,547 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 1085 flow [2023-11-06 21:15:53,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1085, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2023-11-06 21:15:53,548 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-11-06 21:15:53,548 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 1085 flow [2023-11-06 21:15:53,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 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 21:15:53,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:53,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:53,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:15:53,549 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:15:53,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -727325447, now seen corresponding path program 1 times [2023-11-06 21:15:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25299461] [2023-11-06 21:15:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:53,771 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 21:15:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25299461] [2023-11-06 21:15:53,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25299461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:53,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:53,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:15:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84200069] [2023-11-06 21:15:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:53,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:53,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:53,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:53,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:53,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 291 [2023-11-06 21:15:53,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 1085 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 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 21:15:53,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:53,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 291 [2023-11-06 21:15:53,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand