./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_tso.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_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/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_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/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_cbd70fb0-9ff9-416e-9147-d633eef9013d/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 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:41,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:41,363 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:47:41,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:41,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:41,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:41,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:41,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:41,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:41,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:41,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:41,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:41,448 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:41,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:41,451 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:47:41,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:47:41,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:47:41,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:41,453 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:47:41,454 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:47:41,454 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:47:41,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:41,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:47:41,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:47:41,456 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:47:41,457 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:41,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:41,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:41,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:41,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:41,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:41,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:41,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:47:41,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:47:41,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:41,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:41,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:41,464 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:41,464 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_cbd70fb0-9ff9-416e-9147-d633eef9013d/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_cbd70fb0-9ff9-416e-9147-d633eef9013d/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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a [2023-11-06 22:47:41,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:41,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:41,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:41,868 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:41,869 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:41,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-06 22:47:45,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:47:45,770 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:47:45,771 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-06 22:47:45,799 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/data/42d1ddb99/fb2bf6f9bd00435794205690b06bc525/FLAG040b929ff [2023-11-06 22:47:45,817 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/data/42d1ddb99/fb2bf6f9bd00435794205690b06bc525 [2023-11-06 22:47:45,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:47:45,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:47:45,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:45,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:47:45,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:47:45,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:45" (1/1) ... [2023-11-06 22:47:45,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259b2ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:45, skipping insertion in model container [2023-11-06 22:47:45,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:45" (1/1) ... [2023-11-06 22:47:45,959 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:47:46,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:46,361 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:47:46,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:46,540 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:46,540 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:46,548 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:47:46,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46 WrapperNode [2023-11-06 22:47:46,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:46,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:46,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:47:46,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:47:46,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,647 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2023-11-06 22:47:46,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:46,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:47:46,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:47:46,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:47:46,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:47:46,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:47:46,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:47:46,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:47:46,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (1/1) ... [2023-11-06 22:47:46,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:46,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:47:46,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:47:46,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:47:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:47:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:47:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:47:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:47:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:47:46,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:47:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:47:46,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:47:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:47:46,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:47:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:47:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:47:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:47:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:47:46,841 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 22:47:47,029 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:47:47,031 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:47:47,435 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:47:47,714 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:47:47,722 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:47:47,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:47 BoogieIcfgContainer [2023-11-06 22:47:47,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:47:47,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:47:47,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:47:47,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:47:47,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:45" (1/3) ... [2023-11-06 22:47:47,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387131b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:47, skipping insertion in model container [2023-11-06 22:47:47,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:46" (2/3) ... [2023-11-06 22:47:47,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387131b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:47, skipping insertion in model container [2023-11-06 22:47:47,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:47" (3/3) ... [2023-11-06 22:47:47,739 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-11-06 22:47:47,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:47:47,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:47:47,760 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:47:47,850 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:47:47,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 264 flow [2023-11-06 22:47:48,013 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-06 22:47:48,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:48,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 22:47:48,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 126 transitions, 264 flow [2023-11-06 22:47:48,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 255 flow [2023-11-06 22:47:48,036 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:47:48,065 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-06 22:47:48,075 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-06 22:47:48,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 255 flow [2023-11-06 22:47:48,149 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-06 22:47:48,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:48,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 22:47:48,156 INFO L119 LiptonReduction]: Number of co-enabled transitions 2464 [2023-11-06 22:47:56,224 INFO L134 LiptonReduction]: Checked pairs total: 6611 [2023-11-06 22:47:56,224 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-11-06 22:47:56,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:47:56,246 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;@2608a393, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:47:56,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:47:56,248 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:47:56,249 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:47:56,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:56,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:56,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:47:56,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:56,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 591, now seen corresponding path program 1 times [2023-11-06 22:47:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628963954] [2023-11-06 22:47:56,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,499 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 22:47:56,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:56,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628963954] [2023-11-06 22:47:56,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628963954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:56,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:56,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:47:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193614445] [2023-11-06 22:47:56,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:56,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:47:56,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:56,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:47:56,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:47:56,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 251 [2023-11-06 22:47:56,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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 22:47:56,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:56,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 251 [2023-11-06 22:47:56,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:57,125 INFO L124 PetriNetUnfolderBase]: 939/1442 cut-off events. [2023-11-06 22:47:57,125 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:47:57,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 1442 events. 939/1442 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6837 event pairs, 939 based on Foata normal form. 0/1186 useless extension candidates. Maximal degree in co-relation 2870. Up to 1403 conditions per place. [2023-11-06 22:47:57,143 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-06 22:47:57,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-11-06 22:47:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:47:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:47:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 251 transitions. [2023-11-06 22:47:57,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:47:57,159 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 251 transitions. [2023-11-06 22:47:57,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 251 transitions. [2023-11-06 22:47:57,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:57,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 251 transitions. [2023-11-06 22:47:57,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 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 22:47:57,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 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 22:47:57,176 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 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 22:47:57,179 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 251 transitions. [2023-11-06 22:47:57,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-11-06 22:47:57,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:47:57,185 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-11-06 22:47:57,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-06 22:47:57,191 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-11-06 22:47:57,192 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-11-06 22:47:57,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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 22:47:57,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:57,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:57,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:47:57,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:57,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1853062089, now seen corresponding path program 1 times [2023-11-06 22:47:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909218825] [2023-11-06 22:47:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,636 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 22:47:57,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909218825] [2023-11-06 22:47:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909218825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:57,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:57,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256015180] [2023-11-06 22:47:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:57,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:57,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:57,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 251 [2023-11-06 22:47:57,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 22:47:57,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:57,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 251 [2023-11-06 22:47:57,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:58,030 INFO L124 PetriNetUnfolderBase]: 777/1244 cut-off events. [2023-11-06 22:47:58,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:58,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 1244 events. 777/1244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6158 event pairs, 129 based on Foata normal form. 0/1120 useless extension candidates. Maximal degree in co-relation 2444. Up to 937 conditions per place. [2023-11-06 22:47:58,039 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 26 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-06 22:47:58,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 132 flow [2023-11-06 22:47:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-06 22:47:58,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48339973439575035 [2023-11-06 22:47:58,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-06 22:47:58,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-06 22:47:58,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:58,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-06 22:47:58,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 22:47:58,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 22:47:58,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 22:47:58,052 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 364 transitions. [2023-11-06 22:47:58,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 132 flow [2023-11-06 22:47:58,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:58,054 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 22:47:58,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 22:47:58,055 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 22:47:58,055 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 22:47:58,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 22:47:58,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:58,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:58,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:47:58,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:58,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1618831104, now seen corresponding path program 1 times [2023-11-06 22:47:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:58,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204031072] [2023-11-06 22:47:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:58,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,151 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 22:47:59,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:59,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204031072] [2023-11-06 22:47:59,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204031072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:59,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:59,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537476758] [2023-11-06 22:47:59,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:59,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:59,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:59,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:59,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-11-06 22:47:59,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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 22:47:59,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:59,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-11-06 22:47:59,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:59,859 INFO L124 PetriNetUnfolderBase]: 1488/2371 cut-off events. [2023-11-06 22:47:59,860 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-11-06 22:47:59,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4813 conditions, 2371 events. 1488/2371 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12679 event pairs, 125 based on Foata normal form. 0/2287 useless extension candidates. Maximal degree in co-relation 4809. Up to 1550 conditions per place. [2023-11-06 22:47:59,881 INFO L140 encePairwiseOnDemand]: 240/251 looper letters, 40 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2023-11-06 22:47:59,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 230 flow [2023-11-06 22:47:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-11-06 22:47:59,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601593625498008 [2023-11-06 22:47:59,886 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-11-06 22:47:59,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-11-06 22:47:59,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:59,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-11-06 22:47:59,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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 22:47:59,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:47:59,895 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:47:59,895 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 4 states and 462 transitions. [2023-11-06 22:47:59,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 230 flow [2023-11-06 22:47:59,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:59,899 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 142 flow [2023-11-06 22:47:59,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-11-06 22:47:59,901 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-11-06 22:47:59,902 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 142 flow [2023-11-06 22:47:59,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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 22:47:59,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:59,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:59,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:47:59,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:59,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1618831120, now seen corresponding path program 1 times [2023-11-06 22:47:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335566245] [2023-11-06 22:47:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:00,572 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 22:48:00,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:00,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335566245] [2023-11-06 22:48:00,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335566245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:00,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:00,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544038067] [2023-11-06 22:48:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:00,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:00,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 251 [2023-11-06 22:48:00,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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 22:48:00,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:00,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 251 [2023-11-06 22:48:00,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:01,168 INFO L124 PetriNetUnfolderBase]: 970/1545 cut-off events. [2023-11-06 22:48:01,169 INFO L125 PetriNetUnfolderBase]: For 1101/1102 co-relation queries the response was YES. [2023-11-06 22:48:01,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 1545 events. 970/1545 cut-off events. For 1101/1102 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7574 event pairs, 246 based on Foata normal form. 137/1674 useless extension candidates. Maximal degree in co-relation 4343. Up to 1356 conditions per place. [2023-11-06 22:48:01,186 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 31 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-11-06 22:48:01,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 228 flow [2023-11-06 22:48:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-11-06 22:48:01,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40318725099601593 [2023-11-06 22:48:01,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-11-06 22:48:01,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-11-06 22:48:01,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:01,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-11-06 22:48:01,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 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 22:48:01,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 22:48:01,198 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 22:48:01,198 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 142 flow. Second operand 5 states and 506 transitions. [2023-11-06 22:48:01,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 228 flow [2023-11-06 22:48:01,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:01,203 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 124 flow [2023-11-06 22:48:01,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-11-06 22:48:01,204 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-06 22:48:01,205 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 124 flow [2023-11-06 22:48:01,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 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 22:48:01,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:01,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:01,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:48:01,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:01,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1341925651, now seen corresponding path program 1 times [2023-11-06 22:48:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229985915] [2023-11-06 22:48:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:01,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:01,803 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 22:48:01,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:01,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229985915] [2023-11-06 22:48:01,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229985915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:01,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:01,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784645920] [2023-11-06 22:48:01,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:01,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:01,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-06 22:48:01,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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 22:48:01,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:01,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-06 22:48:01,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:02,285 INFO L124 PetriNetUnfolderBase]: 1324/2043 cut-off events. [2023-11-06 22:48:02,285 INFO L125 PetriNetUnfolderBase]: For 699/706 co-relation queries the response was YES. [2023-11-06 22:48:02,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5659 conditions, 2043 events. 1324/2043 cut-off events. For 699/706 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9390 event pairs, 247 based on Foata normal form. 15/2056 useless extension candidates. Maximal degree in co-relation 5652. Up to 1805 conditions per place. [2023-11-06 22:48:02,305 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 42 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2023-11-06 22:48:02,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 317 flow [2023-11-06 22:48:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-11-06 22:48:02,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46912350597609564 [2023-11-06 22:48:02,308 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-11-06 22:48:02,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-11-06 22:48:02,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:02,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-11-06 22:48:02,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 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 22:48:02,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:02,316 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:02,316 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 124 flow. Second operand 4 states and 471 transitions. [2023-11-06 22:48:02,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 317 flow [2023-11-06 22:48:02,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 310 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:02,320 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 206 flow [2023-11-06 22:48:02,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2023-11-06 22:48:02,321 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-06 22:48:02,321 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 206 flow [2023-11-06 22:48:02,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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 22:48:02,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:02,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:02,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:48:02,323 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:02,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2078931205, now seen corresponding path program 1 times [2023-11-06 22:48:02,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:02,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946176204] [2023-11-06 22:48:02,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,236 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 22:48:03,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:03,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946176204] [2023-11-06 22:48:03,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946176204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:03,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:03,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679389780] [2023-11-06 22:48:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:03,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:03,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-11-06 22:48:03,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 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 22:48:03,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:03,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-11-06 22:48:03,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:03,825 INFO L124 PetriNetUnfolderBase]: 1217/1912 cut-off events. [2023-11-06 22:48:03,826 INFO L125 PetriNetUnfolderBase]: For 1638/1654 co-relation queries the response was YES. [2023-11-06 22:48:03,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6045 conditions, 1912 events. 1217/1912 cut-off events. For 1638/1654 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8849 event pairs, 289 based on Foata normal form. 44/1954 useless extension candidates. Maximal degree in co-relation 6036. Up to 1069 conditions per place. [2023-11-06 22:48:03,850 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 44 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2023-11-06 22:48:03,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 381 flow [2023-11-06 22:48:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-11-06 22:48:03,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4442231075697211 [2023-11-06 22:48:03,855 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-11-06 22:48:03,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-11-06 22:48:03,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:03,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-11-06 22:48:03,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 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 22:48:03,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:03,862 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:03,862 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 206 flow. Second operand 4 states and 446 transitions. [2023-11-06 22:48:03,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 381 flow [2023-11-06 22:48:03,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:03,869 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 288 flow [2023-11-06 22:48:03,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2023-11-06 22:48:03,870 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-11-06 22:48:03,870 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 288 flow [2023-11-06 22:48:03,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 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 22:48:03,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:03,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:03,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:48:03,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:03,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash 24440143, now seen corresponding path program 1 times [2023-11-06 22:48:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:03,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513653040] [2023-11-06 22:48:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:04,136 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 22:48:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513653040] [2023-11-06 22:48:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513653040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:04,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:04,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234237953] [2023-11-06 22:48:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:04,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:04,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-06 22:48:04,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 22:48:04,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:04,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-06 22:48:04,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:04,475 INFO L124 PetriNetUnfolderBase]: 567/995 cut-off events. [2023-11-06 22:48:04,475 INFO L125 PetriNetUnfolderBase]: For 1730/1773 co-relation queries the response was YES. [2023-11-06 22:48:04,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 995 events. 567/995 cut-off events. For 1730/1773 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4815 event pairs, 113 based on Foata normal form. 66/1042 useless extension candidates. Maximal degree in co-relation 3538. Up to 764 conditions per place. [2023-11-06 22:48:04,490 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 59 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-11-06 22:48:04,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 574 flow [2023-11-06 22:48:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-06 22:48:04,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47277556440903057 [2023-11-06 22:48:04,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-06 22:48:04,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-06 22:48:04,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:04,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-06 22:48:04,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 22:48:04,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 22:48:04,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 22:48:04,505 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 288 flow. Second operand 3 states and 356 transitions. [2023-11-06 22:48:04,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 574 flow [2023-11-06 22:48:04,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 563 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:04,518 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 307 flow [2023-11-06 22:48:04,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-11-06 22:48:04,521 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-06 22:48:04,522 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 307 flow [2023-11-06 22:48:04,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 22:48:04,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:04,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:04,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:48:04,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:04,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash 151044312, now seen corresponding path program 1 times [2023-11-06 22:48:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987766189] [2023-11-06 22:48:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:05,389 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 22:48:05,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987766189] [2023-11-06 22:48:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987766189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193339816] [2023-11-06 22:48:05,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:05,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:05,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-11-06 22:48:05,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 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 22:48:05,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:05,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-11-06 22:48:05,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:05,861 INFO L124 PetriNetUnfolderBase]: 778/1370 cut-off events. [2023-11-06 22:48:05,861 INFO L125 PetriNetUnfolderBase]: For 2046/2053 co-relation queries the response was YES. [2023-11-06 22:48:05,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 1370 events. 778/1370 cut-off events. For 2046/2053 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6775 event pairs, 198 based on Foata normal form. 35/1405 useless extension candidates. Maximal degree in co-relation 5312. Up to 680 conditions per place. [2023-11-06 22:48:05,878 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 50 selfloop transitions, 11 changer transitions 10/73 dead transitions. [2023-11-06 22:48:05,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 576 flow [2023-11-06 22:48:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-11-06 22:48:05,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448207171314741 [2023-11-06 22:48:05,883 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-11-06 22:48:05,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-11-06 22:48:05,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:05,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-11-06 22:48:05,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 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 22:48:05,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:05,889 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:05,890 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 307 flow. Second operand 4 states and 450 transitions. [2023-11-06 22:48:05,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 576 flow [2023-11-06 22:48:05,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:05,905 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 323 flow [2023-11-06 22:48:05,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-11-06 22:48:05,906 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-11-06 22:48:05,906 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 323 flow [2023-11-06 22:48:05,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 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 22:48:05,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:05,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:05,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:48:05,908 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:05,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1570268773, now seen corresponding path program 1 times [2023-11-06 22:48:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441560100] [2023-11-06 22:48:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:05,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:06,132 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 22:48:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441560100] [2023-11-06 22:48:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441560100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:06,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554526651] [2023-11-06 22:48:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:06,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-06 22:48:06,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 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 22:48:06,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:06,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-06 22:48:06,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:06,350 INFO L124 PetriNetUnfolderBase]: 308/622 cut-off events. [2023-11-06 22:48:06,350 INFO L125 PetriNetUnfolderBase]: For 1018/1045 co-relation queries the response was YES. [2023-11-06 22:48:06,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 622 events. 308/622 cut-off events. For 1018/1045 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3061 event pairs, 43 based on Foata normal form. 88/699 useless extension candidates. Maximal degree in co-relation 2391. Up to 269 conditions per place. [2023-11-06 22:48:06,357 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 57 selfloop transitions, 7 changer transitions 6/79 dead transitions. [2023-11-06 22:48:06,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 676 flow [2023-11-06 22:48:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-11-06 22:48:06,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47310756972111556 [2023-11-06 22:48:06,361 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-11-06 22:48:06,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-11-06 22:48:06,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:06,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-11-06 22:48:06,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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 22:48:06,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:06,367 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:06,367 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 323 flow. Second operand 4 states and 475 transitions. [2023-11-06 22:48:06,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 676 flow [2023-11-06 22:48:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 663 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:06,374 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 326 flow [2023-11-06 22:48:06,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-06 22:48:06,375 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-11-06 22:48:06,375 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 326 flow [2023-11-06 22:48:06,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 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 22:48:06,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:06,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:06,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:48:06,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:06,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1846370911, now seen corresponding path program 1 times [2023-11-06 22:48:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:06,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538247972] [2023-11-06 22:48:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:06,659 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 22:48:06,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:06,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538247972] [2023-11-06 22:48:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538247972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348067287] [2023-11-06 22:48:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:06,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:06,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:06,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:06,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-06 22:48:06,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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 22:48:06,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:06,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-06 22:48:06,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:06,845 INFO L124 PetriNetUnfolderBase]: 237/488 cut-off events. [2023-11-06 22:48:06,845 INFO L125 PetriNetUnfolderBase]: For 1152/1182 co-relation queries the response was YES. [2023-11-06 22:48:06,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 488 events. 237/488 cut-off events. For 1152/1182 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2385 event pairs, 34 based on Foata normal form. 48/527 useless extension candidates. Maximal degree in co-relation 2042. Up to 193 conditions per place. [2023-11-06 22:48:06,850 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 49 selfloop transitions, 10 changer transitions 9/75 dead transitions. [2023-11-06 22:48:06,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 647 flow [2023-11-06 22:48:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-11-06 22:48:06,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645418326693227 [2023-11-06 22:48:06,854 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-11-06 22:48:06,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-11-06 22:48:06,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:06,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-11-06 22:48:06,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 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 22:48:06,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 22:48:06,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 22:48:06,861 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 326 flow. Second operand 5 states and 583 transitions. [2023-11-06 22:48:06,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 647 flow [2023-11-06 22:48:06,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 616 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:06,868 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 283 flow [2023-11-06 22:48:06,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-11-06 22:48:06,869 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-11-06 22:48:06,869 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 283 flow [2023-11-06 22:48:06,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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 22:48:06,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:06,870 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] [2023-11-06 22:48:06,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:48:06,871 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:06,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:06,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1687519678, now seen corresponding path program 1 times [2023-11-06 22:48:06,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:06,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176652421] [2023-11-06 22:48:06,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:06,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:07,121 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 22:48:07,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:07,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176652421] [2023-11-06 22:48:07,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176652421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:07,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:07,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797829735] [2023-11-06 22:48:07,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:07,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:07,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:07,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:07,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:07,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-06 22:48:07,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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 22:48:07,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:07,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-06 22:48:07,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:07,267 INFO L124 PetriNetUnfolderBase]: 135/289 cut-off events. [2023-11-06 22:48:07,267 INFO L125 PetriNetUnfolderBase]: For 821/822 co-relation queries the response was YES. [2023-11-06 22:48:07,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 289 events. 135/289 cut-off events. For 821/822 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1074 event pairs, 27 based on Foata normal form. 2/291 useless extension candidates. Maximal degree in co-relation 1278. Up to 172 conditions per place. [2023-11-06 22:48:07,270 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 28 selfloop transitions, 1 changer transitions 34/65 dead transitions. [2023-11-06 22:48:07,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 568 flow [2023-11-06 22:48:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-11-06 22:48:07,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46713147410358563 [2023-11-06 22:48:07,274 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-11-06 22:48:07,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-11-06 22:48:07,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:07,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-11-06 22:48:07,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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 22:48:07,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:07,281 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 22:48:07,282 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 283 flow. Second operand 4 states and 469 transitions. [2023-11-06 22:48:07,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 568 flow [2023-11-06 22:48:07,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 494 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-11-06 22:48:07,287 INFO L231 Difference]: Finished difference. Result has 57 places, 29 transitions, 167 flow [2023-11-06 22:48:07,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=29} [2023-11-06 22:48:07,288 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-11-06 22:48:07,288 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 29 transitions, 167 flow [2023-11-06 22:48:07,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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 22:48:07,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:07,289 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] [2023-11-06 22:48:07,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:48:07,290 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:07,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1471893034, now seen corresponding path program 2 times [2023-11-06 22:48:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075298071] [2023-11-06 22:48:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:08,635 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 22:48:08,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:08,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075298071] [2023-11-06 22:48:08,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075298071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:08,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:08,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:48:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98057934] [2023-11-06 22:48:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:08,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:08,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:08,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-11-06 22:48:08,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 29 transitions, 167 flow. Second operand has 8 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 0 states have call successors, (0), 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 22:48:08,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:08,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-11-06 22:48:08,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:09,037 INFO L124 PetriNetUnfolderBase]: 55/136 cut-off events. [2023-11-06 22:48:09,038 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2023-11-06 22:48:09,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 136 events. 55/136 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 380 event pairs, 16 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 537. Up to 70 conditions per place. [2023-11-06 22:48:09,040 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 25 selfloop transitions, 7 changer transitions 15/49 dead transitions. [2023-11-06 22:48:09,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 367 flow [2023-11-06 22:48:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-11-06 22:48:09,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42458736482640863 [2023-11-06 22:48:09,045 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-11-06 22:48:09,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-11-06 22:48:09,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:09,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-11-06 22:48:09,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 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 22:48:09,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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 22:48:09,054 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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 22:48:09,054 INFO L175 Difference]: Start difference. First operand has 57 places, 29 transitions, 167 flow. Second operand 7 states and 746 transitions. [2023-11-06 22:48:09,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 367 flow [2023-11-06 22:48:09,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 330 flow, removed 5 selfloop flow, removed 12 redundant places. [2023-11-06 22:48:09,058 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 154 flow [2023-11-06 22:48:09,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-11-06 22:48:09,059 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-11-06 22:48:09,059 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 154 flow [2023-11-06 22:48:09,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 0 states have call successors, (0), 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 22:48:09,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:09,060 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] [2023-11-06 22:48:09,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:48:09,061 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:09,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1110721928, now seen corresponding path program 3 times [2023-11-06 22:48:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:09,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644603916] [2023-11-06 22:48:09,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:09,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:48:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:09,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:48:09,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:48:09,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:48:09,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:48:09,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:48:09,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:48:09,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:48:09,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:48:09,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:48:09,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:48:09,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:48:09,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:48:09,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:48:09,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:48:09,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:48:09,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:48:09,283 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:09,290 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:48:09,290 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:48:09,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:48:09 BasicIcfg [2023-11-06 22:48:09,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:48:09,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:48:09,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:48:09,423 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:48:09,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:47" (3/4) ... [2023-11-06 22:48:09,425 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:48:09,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:48:09,428 INFO L158 Benchmark]: Toolchain (without parser) took 23605.33ms. Allocated memory was 127.9MB in the beginning and 432.0MB in the end (delta: 304.1MB). Free memory was 67.3MB in the beginning and 380.7MB in the end (delta: -313.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:09,428 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 127.9MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:09,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 718.06ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 67.0MB in the beginning and 120.9MB in the end (delta: -53.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2023-11-06 22:48:09,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.33ms. Allocated memory is still 169.9MB. Free memory was 120.2MB in the beginning and 117.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:09,429 INFO L158 Benchmark]: Boogie Preprocessor took 93.99ms. Allocated memory is still 169.9MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:09,430 INFO L158 Benchmark]: RCFGBuilder took 981.83ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 127.7MB in the end (delta: -12.3MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2023-11-06 22:48:09,431 INFO L158 Benchmark]: TraceAbstraction took 21692.59ms. Allocated memory was 169.9MB in the beginning and 432.0MB in the end (delta: 262.1MB). Free memory was 126.7MB in the beginning and 380.7MB in the end (delta: -254.0MB). Peak memory consumption was 249.3MB. Max. memory is 16.1GB. [2023-11-06 22:48:09,431 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 432.0MB. Free memory is still 380.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:09,433 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 127.9MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 718.06ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 67.0MB in the beginning and 120.9MB in the end (delta: -53.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.33ms. Allocated memory is still 169.9MB. Free memory was 120.2MB in the beginning and 117.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.99ms. Allocated memory is still 169.9MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 981.83ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 127.7MB in the end (delta: -12.3MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21692.59ms. Allocated memory was 169.9MB in the beginning and 432.0MB in the end (delta: 262.1MB). Free memory was 126.7MB in the beginning and 380.7MB in the end (delta: -254.0MB). Peak memory consumption was 249.3MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 432.0MB. Free memory is still 380.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 130 PlacesBefore, 40 PlacesAfterwards, 123 TransitionsBefore, 30 TransitionsAfterwards, 2464 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 125 TotalNumberOfCompositions, 6611 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3028, independent: 2833, independent conditional: 0, independent unconditional: 2833, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1354, independent: 1298, independent conditional: 0, independent unconditional: 1298, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3028, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 1354, unknown conditional: 0, unknown unconditional: 1354] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=-2, t763={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=-1, t763={5:0}, t764={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix028_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 57 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:48:09,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/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_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/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 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:48:12,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:48:12,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:48:12,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:48:12,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:48:12,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:48:12,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:48:12,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:48:12,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:48:12,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:48:12,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:48:12,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:48:12,616 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:48:12,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:48:12,620 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:48:12,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:48:12,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:48:12,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:48:12,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:48:12,623 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:48:12,624 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:48:12,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:48:12,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:48:12,626 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:48:12,627 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:48:12,627 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:48:12,628 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:48:12,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:48:12,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:48:12,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:48:12,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:48:12,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:12,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:48:12,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:48:12,634 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:48:12,635 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:48:12,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:48:12,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:48:12,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:48:12,637 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:48:12,638 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:48:12,638 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_cbd70fb0-9ff9-416e-9147-d633eef9013d/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_cbd70fb0-9ff9-416e-9147-d633eef9013d/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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a [2023-11-06 22:48:13,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:48:13,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:48:13,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:48:13,106 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:48:13,107 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:48:13,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-06 22:48:16,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:48:16,694 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:48:16,695 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-06 22:48:16,736 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/data/8a8386ddc/d34711b63c0a476cb4ec1a7119adf803/FLAGd34063660 [2023-11-06 22:48:16,755 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/data/8a8386ddc/d34711b63c0a476cb4ec1a7119adf803 [2023-11-06 22:48:16,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:48:16,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:48:16,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:16,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:48:16,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:48:16,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:16" (1/1) ... [2023-11-06 22:48:16,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7047b050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:16, skipping insertion in model container [2023-11-06 22:48:16,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:16" (1/1) ... [2023-11-06 22:48:16,838 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:48:17,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:17,555 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:48:17,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:17,801 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:48:17,801 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:48:17,810 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:48:17,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17 WrapperNode [2023-11-06 22:48:17,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:17,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:17,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:48:17,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:48:17,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:17,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:17,932 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-11-06 22:48:17,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:17,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:48:17,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:48:17,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:48:17,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:17,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:17,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:17,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:17,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:18,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:18,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:18,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:18,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:48:18,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:48:18,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:48:18,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:48:18,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (1/1) ... [2023-11-06 22:48:18,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:18,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:18,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:48:18,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:48:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:48:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:48:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:48:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:48:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:48:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:48:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:48:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:48:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:48:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:48:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:48:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:48:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:48:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:48:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:48:18,126 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 22:48:18,322 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:48:18,325 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:48:18,921 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:48:19,195 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:48:19,196 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:48:19,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:19 BoogieIcfgContainer [2023-11-06 22:48:19,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:48:19,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:48:19,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:48:19,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:48:19,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:16" (1/3) ... [2023-11-06 22:48:19,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75de23bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:19, skipping insertion in model container [2023-11-06 22:48:19,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:17" (2/3) ... [2023-11-06 22:48:19,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75de23bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:19, skipping insertion in model container [2023-11-06 22:48:19,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:19" (3/3) ... [2023-11-06 22:48:19,210 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-11-06 22:48:19,237 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:48:19,238 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:48:19,238 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:48:19,327 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:48:19,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 127 transitions, 266 flow [2023-11-06 22:48:19,451 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-06 22:48:19,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:19,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 22:48:19,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 127 transitions, 266 flow [2023-11-06 22:48:19,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 124 transitions, 257 flow [2023-11-06 22:48:19,474 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:48:19,495 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-06 22:48:19,505 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-06 22:48:19,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 257 flow [2023-11-06 22:48:19,563 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-06 22:48:19,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:19,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 22:48:19,568 INFO L119 LiptonReduction]: Number of co-enabled transitions 2464 [2023-11-06 22:48:31,407 INFO L134 LiptonReduction]: Checked pairs total: 6814 [2023-11-06 22:48:31,407 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-11-06 22:48:31,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:48:31,440 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;@505053f3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:48:31,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:48:31,448 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:48:31,448 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:48:31,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:31,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:31,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:48:31,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:31,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2023-11-06 22:48:31,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:31,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889108680] [2023-11-06 22:48:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:31,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:31,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:31,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:31,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:48:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:31,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:48:31,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:31,603 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 22:48:31,604 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:31,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:31,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889108680] [2023-11-06 22:48:31,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889108680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:31,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:31,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:48:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716001915] [2023-11-06 22:48:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:31,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:48:31,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:48:31,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:48:31,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2023-11-06 22:48:31,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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 22:48:31,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:31,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2023-11-06 22:48:31,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:32,197 INFO L124 PetriNetUnfolderBase]: 1263/1922 cut-off events. [2023-11-06 22:48:32,197 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:48:32,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 1922 events. 1263/1922 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9508 event pairs, 1263 based on Foata normal form. 72/1666 useless extension candidates. Maximal degree in co-relation 3818. Up to 1871 conditions per place. [2023-11-06 22:48:32,221 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-06 22:48:32,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-11-06 22:48:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:48:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:48:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2023-11-06 22:48:32,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5039370078740157 [2023-11-06 22:48:32,242 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 256 transitions. [2023-11-06 22:48:32,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 256 transitions. [2023-11-06 22:48:32,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:32,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 256 transitions. [2023-11-06 22:48:32,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 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 22:48:32,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 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 22:48:32,260 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 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 22:48:32,262 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 256 transitions. [2023-11-06 22:48:32,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-11-06 22:48:32,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:32,269 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-06 22:48:32,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-06 22:48:32,276 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 22:48:32,277 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-06 22:48:32,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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 22:48:32,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:32,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:32,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:32,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:32,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:32,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1757956979, now seen corresponding path program 1 times [2023-11-06 22:48:32,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:32,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685703182] [2023-11-06 22:48:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:32,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:32,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:32,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:32,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:48:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:32,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:32,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:32,646 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 22:48:32,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:32,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:32,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685703182] [2023-11-06 22:48:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685703182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:32,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:32,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090833077] [2023-11-06 22:48:32,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:32,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:32,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:32,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2023-11-06 22:48:32,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 22:48:32,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:32,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2023-11-06 22:48:32,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:33,097 INFO L124 PetriNetUnfolderBase]: 1043/1654 cut-off events. [2023-11-06 22:48:33,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:33,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1654 events. 1043/1654 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8531 event pairs, 163 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 3240. Up to 1265 conditions per place. [2023-11-06 22:48:33,113 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 28 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-11-06 22:48:33,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-11-06 22:48:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-11-06 22:48:33,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868766404199475 [2023-11-06 22:48:33,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-11-06 22:48:33,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-11-06 22:48:33,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:33,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-11-06 22:48:33,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 22:48:33,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 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 22:48:33,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 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 22:48:33,144 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 371 transitions. [2023-11-06 22:48:33,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-11-06 22:48:33,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:33,146 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-11-06 22:48:33,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-06 22:48:33,147 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-06 22:48:33,148 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-11-06 22:48:33,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 22:48:33,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:33,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:33,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:33,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:33,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:33,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:33,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1532621401, now seen corresponding path program 1 times [2023-11-06 22:48:33,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:33,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134887760] [2023-11-06 22:48:33,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:33,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:33,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:33,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:48:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:48:33,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:33,583 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 22:48:33,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:33,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:33,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134887760] [2023-11-06 22:48:33,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134887760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:33,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:33,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:33,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930687491] [2023-11-06 22:48:33,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:33,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:33,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:33,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:33,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:33,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 254 [2023-11-06 22:48:33,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 22:48:33,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:33,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 254 [2023-11-06 22:48:33,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:33,900 INFO L124 PetriNetUnfolderBase]: 417/697 cut-off events. [2023-11-06 22:48:33,900 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-06 22:48:33,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 697 events. 417/697 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3038 event pairs, 95 based on Foata normal form. 24/682 useless extension candidates. Maximal degree in co-relation 1460. Up to 609 conditions per place. [2023-11-06 22:48:33,909 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 29 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-11-06 22:48:33,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 154 flow [2023-11-06 22:48:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-11-06 22:48:33,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473753280839895 [2023-11-06 22:48:33,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-11-06 22:48:33,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-11-06 22:48:33,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:33,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-11-06 22:48:33,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 22:48:33,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 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 22:48:33,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 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 22:48:33,922 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 3 states and 361 transitions. [2023-11-06 22:48:33,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 154 flow [2023-11-06 22:48:33,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:33,926 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 78 flow [2023-11-06 22:48:33,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-06 22:48:33,929 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 22:48:33,929 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 78 flow [2023-11-06 22:48:33,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 22:48:33,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:33,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:33,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:34,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:34,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:34,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2119212580, now seen corresponding path program 1 times [2023-11-06 22:48:34,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:34,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513864975] [2023-11-06 22:48:34,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:34,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:34,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:34,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:48:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:34,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:34,378 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 22:48:34,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:34,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:34,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513864975] [2023-11-06 22:48:34,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513864975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:34,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410128391] [2023-11-06 22:48:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:34,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:34,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:34,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:34,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:34,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 254 [2023-11-06 22:48:34,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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 22:48:34,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:34,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 254 [2023-11-06 22:48:34,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:34,635 INFO L124 PetriNetUnfolderBase]: 157/307 cut-off events. [2023-11-06 22:48:34,636 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-06 22:48:34,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 307 events. 157/307 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1146 event pairs, 44 based on Foata normal form. 26/320 useless extension candidates. Maximal degree in co-relation 764. Up to 129 conditions per place. [2023-11-06 22:48:34,639 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 37 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-11-06 22:48:34,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 220 flow [2023-11-06 22:48:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-11-06 22:48:34,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734251968503937 [2023-11-06 22:48:34,643 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-11-06 22:48:34,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-11-06 22:48:34,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:34,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-11-06 22:48:34,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 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 22:48:34,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 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 22:48:34,651 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 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 22:48:34,651 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 78 flow. Second operand 4 states and 481 transitions. [2023-11-06 22:48:34,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 220 flow [2023-11-06 22:48:34,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:34,654 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 114 flow [2023-11-06 22:48:34,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-06 22:48:34,656 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-11-06 22:48:34,656 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 114 flow [2023-11-06 22:48:34,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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 22:48:34,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:34,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:34,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:34,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:34,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:34,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2036305048, now seen corresponding path program 1 times [2023-11-06 22:48:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:34,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444336442] [2023-11-06 22:48:34,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:34,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:34,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:34,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:34,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:48:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:35,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:35,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:35,095 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 22:48:35,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:35,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:35,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444336442] [2023-11-06 22:48:35,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444336442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:35,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:35,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:35,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934263421] [2023-11-06 22:48:35,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:35,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:35,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:35,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 254 [2023-11-06 22:48:35,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 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 22:48:35,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:35,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 254 [2023-11-06 22:48:35,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:35,410 INFO L124 PetriNetUnfolderBase]: 112/217 cut-off events. [2023-11-06 22:48:35,410 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-06 22:48:35,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 217 events. 112/217 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 757 event pairs, 39 based on Foata normal form. 9/222 useless extension candidates. Maximal degree in co-relation 609. Up to 90 conditions per place. [2023-11-06 22:48:35,413 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 34 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-11-06 22:48:35,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 244 flow [2023-11-06 22:48:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-11-06 22:48:35,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645669291338583 [2023-11-06 22:48:35,417 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-11-06 22:48:35,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-11-06 22:48:35,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:35,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-11-06 22:48:35,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 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 22:48:35,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 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 22:48:35,426 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 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 22:48:35,426 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 114 flow. Second operand 5 states and 590 transitions. [2023-11-06 22:48:35,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 244 flow [2023-11-06 22:48:35,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 230 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:35,430 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 128 flow [2023-11-06 22:48:35,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-06 22:48:35,431 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-06 22:48:35,431 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 128 flow [2023-11-06 22:48:35,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 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 22:48:35,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:35,433 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] [2023-11-06 22:48:35,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:35,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:35,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:35,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash -588320841, now seen corresponding path program 1 times [2023-11-06 22:48:35,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:35,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772124731] [2023-11-06 22:48:35,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:35,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:35,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:35,650 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:35,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:48:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:35,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:35,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:36,084 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 22:48:36,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:36,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:36,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772124731] [2023-11-06 22:48:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772124731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:36,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:36,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507466051] [2023-11-06 22:48:36,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:36,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:36,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2023-11-06 22:48:36,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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 22:48:36,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:36,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2023-11-06 22:48:36,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:36,376 INFO L124 PetriNetUnfolderBase]: 202/392 cut-off events. [2023-11-06 22:48:36,376 INFO L125 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2023-11-06 22:48:36,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 392 events. 202/392 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1697 event pairs, 95 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 1137. Up to 231 conditions per place. [2023-11-06 22:48:36,381 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 45 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-11-06 22:48:36,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 334 flow [2023-11-06 22:48:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-11-06 22:48:36,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625984251968504 [2023-11-06 22:48:36,386 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-11-06 22:48:36,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-11-06 22:48:36,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:36,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-11-06 22:48:36,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 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 22:48:36,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 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 22:48:36,393 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 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 22:48:36,394 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 128 flow. Second operand 4 states and 470 transitions. [2023-11-06 22:48:36,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 334 flow [2023-11-06 22:48:36,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 284 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:36,400 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 130 flow [2023-11-06 22:48:36,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-06 22:48:36,402 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-06 22:48:36,402 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 130 flow [2023-11-06 22:48:36,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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 22:48:36,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:36,403 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] [2023-11-06 22:48:36,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-06 22:48:36,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:36,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:36,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:36,622 INFO L85 PathProgramCache]: Analyzing trace with hash 549703546, now seen corresponding path program 1 times [2023-11-06 22:48:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342200842] [2023-11-06 22:48:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:36,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:36,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:36,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:36,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:48:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:36,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:48:36,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:37,390 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 22:48:37,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:37,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:37,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342200842] [2023-11-06 22:48:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342200842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662269824] [2023-11-06 22:48:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:37,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:37,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 254 [2023-11-06 22:48:37,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 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 22:48:37,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:37,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 254 [2023-11-06 22:48:37,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:37,911 INFO L124 PetriNetUnfolderBase]: 162/326 cut-off events. [2023-11-06 22:48:37,912 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2023-11-06 22:48:37,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 326 events. 162/326 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1444 event pairs, 1 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 929. Up to 265 conditions per place. [2023-11-06 22:48:37,915 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 31 selfloop transitions, 3 changer transitions 3/40 dead transitions. [2023-11-06 22:48:37,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 239 flow [2023-11-06 22:48:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-11-06 22:48:37,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39921259842519685 [2023-11-06 22:48:37,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-11-06 22:48:37,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-11-06 22:48:37,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:37,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-11-06 22:48:37,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 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 22:48:37,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 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 22:48:37,926 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 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 22:48:37,926 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 130 flow. Second operand 5 states and 507 transitions. [2023-11-06 22:48:37,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 239 flow [2023-11-06 22:48:37,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:37,935 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 114 flow [2023-11-06 22:48:37,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-06 22:48:37,936 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-11-06 22:48:37,937 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 114 flow [2023-11-06 22:48:37,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 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 22:48:37,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:37,938 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] [2023-11-06 22:48:37,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:38,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:38,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:38,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1947798511, now seen corresponding path program 2 times [2023-11-06 22:48:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:38,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772467075] [2023-11-06 22:48:38,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:48:38,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:38,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:38,162 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:38,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:48:38,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:48:38,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:48:38,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:38,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:38,955 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 22:48:38,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:38,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:38,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772467075] [2023-11-06 22:48:38,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772467075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:38,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:38,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:38,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766983377] [2023-11-06 22:48:38,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:38,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:38,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:38,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:38,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-11-06 22:48:38,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 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 22:48:38,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:38,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-11-06 22:48:38,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:39,245 INFO L124 PetriNetUnfolderBase]: 106/241 cut-off events. [2023-11-06 22:48:39,245 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2023-11-06 22:48:39,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 241 events. 106/241 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 917 event pairs, 16 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 702. Up to 148 conditions per place. [2023-11-06 22:48:39,247 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 27 selfloop transitions, 1 changer transitions 22/52 dead transitions. [2023-11-06 22:48:39,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 314 flow [2023-11-06 22:48:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2023-11-06 22:48:39,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519685039370079 [2023-11-06 22:48:39,252 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2023-11-06 22:48:39,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2023-11-06 22:48:39,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:39,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2023-11-06 22:48:39,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 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 22:48:39,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 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 22:48:39,260 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 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 22:48:39,260 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 114 flow. Second operand 5 states and 574 transitions. [2023-11-06 22:48:39,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 314 flow [2023-11-06 22:48:39,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 297 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-06 22:48:39,264 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 112 flow [2023-11-06 22:48:39,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-11-06 22:48:39,269 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-11-06 22:48:39,273 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 112 flow [2023-11-06 22:48:39,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 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 22:48:39,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:39,275 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] [2023-11-06 22:48:39,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:39,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:39,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:39,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash -665570619, now seen corresponding path program 3 times [2023-11-06 22:48:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108486081] [2023-11-06 22:48:39,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:48:39,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:39,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:39,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:39,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:48:39,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:48:39,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:48:39,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:48:39,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:39,952 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 22:48:39,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:39,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:39,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108486081] [2023-11-06 22:48:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108486081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:39,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:39,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955749216] [2023-11-06 22:48:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:39,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:48:39,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:39,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:48:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:40,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2023-11-06 22:48:40,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 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 22:48:40,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:40,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2023-11-06 22:48:40,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:40,294 INFO L124 PetriNetUnfolderBase]: 105/227 cut-off events. [2023-11-06 22:48:40,294 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2023-11-06 22:48:40,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 227 events. 105/227 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 767 event pairs, 38 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 689. Up to 125 conditions per place. [2023-11-06 22:48:40,296 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 28 selfloop transitions, 3 changer transitions 13/46 dead transitions. [2023-11-06 22:48:40,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 277 flow [2023-11-06 22:48:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2023-11-06 22:48:40,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511811023622047 [2023-11-06 22:48:40,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 573 transitions. [2023-11-06 22:48:40,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 573 transitions. [2023-11-06 22:48:40,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:40,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 573 transitions. [2023-11-06 22:48:40,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 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 22:48:40,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 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 22:48:40,311 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 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 22:48:40,312 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 112 flow. Second operand 5 states and 573 transitions. [2023-11-06 22:48:40,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 277 flow [2023-11-06 22:48:40,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 270 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:40,317 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 121 flow [2023-11-06 22:48:40,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-11-06 22:48:40,319 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-06 22:48:40,319 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 121 flow [2023-11-06 22:48:40,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 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 22:48:40,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:40,320 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] [2023-11-06 22:48:40,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:40,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:40,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:48:40,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash 496635087, now seen corresponding path program 4 times [2023-11-06 22:48:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:40,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375308245] [2023-11-06 22:48:40,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:48:40,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:40,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:40,539 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:48:40,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:48:40,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:48:40,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:48:40,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:48:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:41,041 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:48:41,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:48:41,043 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:48:41,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:48:41,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:48:41,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:48:41,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:48:41,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:48:41,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:48:41,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:48:41,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:48:41,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:48:41,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:48:41,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:48:41,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:48:41,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:41,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:41,264 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:41,270 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:48:41,270 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:48:41,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:48:41 BasicIcfg [2023-11-06 22:48:41,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:48:41,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:48:41,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:48:41,367 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:48:41,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:19" (3/4) ... [2023-11-06 22:48:41,370 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:48:41,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:48:41,372 INFO L158 Benchmark]: Toolchain (without parser) took 24612.23ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 60.7MB in the beginning and 66.0MB in the end (delta: -5.3MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2023-11-06 22:48:41,373 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 60.8MB. Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:41,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1050.22ms. Allocated memory is still 86.0MB. Free memory was 60.5MB in the beginning and 57.5MB in the end (delta: 3.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-11-06 22:48:41,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.91ms. Allocated memory is still 86.0MB. Free memory was 57.5MB in the beginning and 54.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:48:41,374 INFO L158 Benchmark]: Boogie Preprocessor took 93.08ms. Allocated memory is still 86.0MB. Free memory was 54.2MB in the beginning and 52.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:41,375 INFO L158 Benchmark]: RCFGBuilder took 1165.56ms. Allocated memory is still 86.0MB. Free memory was 52.1MB in the beginning and 59.6MB in the end (delta: -7.5MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2023-11-06 22:48:41,375 INFO L158 Benchmark]: TraceAbstraction took 22161.30ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 58.5MB in the beginning and 66.0MB in the end (delta: -7.5MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2023-11-06 22:48:41,376 INFO L158 Benchmark]: Witness Printer took 5.41ms. Allocated memory is still 151.0MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:41,379 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 60.8MB. Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1050.22ms. Allocated memory is still 86.0MB. Free memory was 60.5MB in the beginning and 57.5MB in the end (delta: 3.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.91ms. Allocated memory is still 86.0MB. Free memory was 57.5MB in the beginning and 54.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.08ms. Allocated memory is still 86.0MB. Free memory was 54.2MB in the beginning and 52.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.56ms. Allocated memory is still 86.0MB. Free memory was 52.1MB in the beginning and 59.6MB in the end (delta: -7.5MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22161.30ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 58.5MB in the beginning and 66.0MB in the end (delta: -7.5MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * Witness Printer took 5.41ms. Allocated memory is still 151.0MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9s, 131 PlacesBefore, 42 PlacesAfterwards, 124 TransitionsBefore, 33 TransitionsAfterwards, 2464 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 127 TotalNumberOfCompositions, 6814 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2934, independent: 2743, independent conditional: 0, independent unconditional: 2743, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1307, independent: 1276, independent conditional: 0, independent unconditional: 1276, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2934, independent: 1467, independent conditional: 0, independent unconditional: 1467, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 1307, unknown conditional: 0, unknown unconditional: 1307] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=0, t763={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=1, t763={-6:0}, t764={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=2, t763={-6:0}, t764={-10:0}, t765={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={-6:0}, t764={-10:0}, t765={-2:0}, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix028_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 24 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 1086 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1136 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:48:41,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd70fb0-9ff9-416e-9147-d633eef9013d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample