./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:13:29,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:13:30,039 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:13:30,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:13:30,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:13:30,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:13:30,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:13:30,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:13:30,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:13:30,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:13:30,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:13:30,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:13:30,097 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:13:30,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:13:30,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:13:30,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:13:30,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:13:30,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:13:30,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:13:30,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:13:30,102 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:13:30,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:13:30,103 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:13:30,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:13:30,104 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:13:30,105 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:13:30,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:13:30,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:13:30,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:13:30,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:13:30,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:13:30,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:13:30,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:13:30,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:13:30,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:13:30,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:13:30,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:13:30,111 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:13:30,111 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_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/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_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-11-12 02:13:30,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:13:30,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:13:30,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:13:30,460 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:13:30,461 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:13:30,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-12 02:13:33,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:13:34,026 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:13:34,027 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-12 02:13:34,054 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/data/00dad4923/45ca485525b9410b94a5765d7ff15ba5/FLAG0d9251351 [2023-11-12 02:13:34,069 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/data/00dad4923/45ca485525b9410b94a5765d7ff15ba5 [2023-11-12 02:13:34,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:13:34,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:13:34,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:13:34,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:13:34,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:13:34,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38470b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34, skipping insertion in model container [2023-11-12 02:13:34,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,133 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:13:34,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:13:34,620 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:13:34,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:13:34,772 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:13:34,773 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:13:34,781 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:13:34,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34 WrapperNode [2023-11-12 02:13:34,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:13:34,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:13:34,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:13:34,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:13:34,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,840 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2023-11-12 02:13:34,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:13:34,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:13:34,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:13:34,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:13:34,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:13:34,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:13:34,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:13:34,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:13:34,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (1/1) ... [2023-11-12 02:13:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:13:34,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:34,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:34,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:13:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:13:34,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:13:34,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:13:34,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:13:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:13:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:13:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:13:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:13:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:13:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:13:34,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:13:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:13:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:13:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:13:34,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:13:34,970 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:13:35,157 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:13:35,160 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:13:35,605 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:13:35,871 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:13:35,872 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:13:35,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:35 BoogieIcfgContainer [2023-11-12 02:13:35,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:13:35,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:13:35,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:13:35,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:13:35,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:13:34" (1/3) ... [2023-11-12 02:13:35,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c138fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:13:35, skipping insertion in model container [2023-11-12 02:13:35,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:34" (2/3) ... [2023-11-12 02:13:35,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c138fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:13:35, skipping insertion in model container [2023-11-12 02:13:35,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:35" (3/3) ... [2023-11-12 02:13:35,889 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-11-12 02:13:35,912 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:13:35,912 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 02:13:35,912 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:13:35,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:13:36,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 280 flow [2023-11-12 02:13:36,150 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-11-12 02:13:36,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:13:36,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-12 02:13:36,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 280 flow [2023-11-12 02:13:36,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-11-12 02:13:36,177 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:13:36,195 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-11-12 02:13:36,198 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-11-12 02:13:36,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-11-12 02:13:36,262 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-11-12 02:13:36,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:13:36,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-12 02:13:36,267 INFO L119 LiptonReduction]: Number of co-enabled transitions 3010 [2023-11-12 02:13:42,263 INFO L134 LiptonReduction]: Checked pairs total: 8198 [2023-11-12 02:13:42,263 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-11-12 02:13:42,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:13:42,287 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;@11678cfd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:13:42,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-12 02:13:42,289 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:13:42,289 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:13:42,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:13:42,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:42,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:13:42,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:42,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:42,297 INFO L85 PathProgramCache]: Analyzing trace with hash 592, now seen corresponding path program 1 times [2023-11-12 02:13:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994590454] [2023-11-12 02:13:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:42,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:42,450 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-12 02:13:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994590454] [2023-11-12 02:13:42,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994590454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:42,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:42,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:13:42,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764812099] [2023-11-12 02:13:42,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:42,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:13:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:13:42,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:13:42,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 261 [2023-11-12 02:13:42,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:42,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:42,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 261 [2023-11-12 02:13:42,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:43,191 INFO L124 PetriNetUnfolderBase]: 2251/3357 cut-off events. [2023-11-12 02:13:43,191 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-12 02:13:43,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6688 conditions, 3357 events. 2251/3357 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17072 event pairs, 2251 based on Foata normal form. 120/2908 useless extension candidates. Maximal degree in co-relation 6677. Up to 3269 conditions per place. [2023-11-12 02:13:43,224 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-11-12 02:13:43,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 115 flow [2023-11-12 02:13:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:13:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:13:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 272 transitions. [2023-11-12 02:13:43,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210727969348659 [2023-11-12 02:13:43,241 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 272 transitions. [2023-11-12 02:13:43,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 272 transitions. [2023-11-12 02:13:43,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:43,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 272 transitions. [2023-11-12 02:13:43,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 136.0) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:43,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:43,255 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:43,257 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 272 transitions. [2023-11-12 02:13:43,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 115 flow [2023-11-12 02:13:43,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:13:43,264 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-11-12 02:13:43,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-12 02:13:43,270 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-11-12 02:13:43,270 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-11-12 02:13:43,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:43,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:43,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:13:43,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:13:43,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:43,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash 558209829, now seen corresponding path program 1 times [2023-11-12 02:13:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:43,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754032655] [2023-11-12 02:13:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:43,661 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-12 02:13:43,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:43,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754032655] [2023-11-12 02:13:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754032655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:43,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:43,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:13:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386409412] [2023-11-12 02:13:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:43,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:13:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:13:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:13:43,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 261 [2023-11-12 02:13:43,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:43,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:43,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 261 [2023-11-12 02:13:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:44,206 INFO L124 PetriNetUnfolderBase]: 1849/2815 cut-off events. [2023-11-12 02:13:44,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:13:44,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5566 conditions, 2815 events. 1849/2815 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14601 event pairs, 433 based on Foata normal form. 0/2510 useless extension candidates. Maximal degree in co-relation 5563. Up to 2281 conditions per place. [2023-11-12 02:13:44,229 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-11-12 02:13:44,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 174 flow [2023-11-12 02:13:44,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:13:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:13:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-11-12 02:13:44,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508301404853129 [2023-11-12 02:13:44,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-11-12 02:13:44,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-11-12 02:13:44,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:44,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-11-12 02:13:44,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:44,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:44,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:44,250 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 398 transitions. [2023-11-12 02:13:44,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 174 flow [2023-11-12 02:13:44,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:13:44,255 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-11-12 02:13:44,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-12 02:13:44,258 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-11-12 02:13:44,258 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-11-12 02:13:44,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:44,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:44,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:44,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:13:44,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:44,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash 238935617, now seen corresponding path program 1 times [2023-11-12 02:13:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:44,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164702657] [2023-11-12 02:13:44,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:44,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:45,081 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-12 02:13:45,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:45,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164702657] [2023-11-12 02:13:45,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164702657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:45,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:45,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:13:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493835776] [2023-11-12 02:13:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:45,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:13:45,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:45,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:13:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:13:45,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 261 [2023-11-12 02:13:45,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:45,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:45,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 261 [2023-11-12 02:13:45,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:45,854 INFO L124 PetriNetUnfolderBase]: 2127/3097 cut-off events. [2023-11-12 02:13:45,854 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2023-11-12 02:13:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6416 conditions, 3097 events. 2127/3097 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14177 event pairs, 579 based on Foata normal form. 0/3000 useless extension candidates. Maximal degree in co-relation 6412. Up to 2017 conditions per place. [2023-11-12 02:13:45,883 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 52 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-11-12 02:13:45,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 250 flow [2023-11-12 02:13:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:13:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:13:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-11-12 02:13:45,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521072796934866 [2023-11-12 02:13:45,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-11-12 02:13:45,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-11-12 02:13:45,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:45,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-11-12 02:13:45,891 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-12 02:13:45,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:45,896 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:45,896 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 5 states and 590 transitions. [2023-11-12 02:13:45,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 59 transitions, 250 flow [2023-11-12 02:13:45,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:13:45,901 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 93 flow [2023-11-12 02:13:45,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-12 02:13:45,903 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-11-12 02:13:45,903 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 93 flow [2023-11-12 02:13:45,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:45,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:45,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:45,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:13:45,909 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:45,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash 238935629, now seen corresponding path program 1 times [2023-11-12 02:13:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:45,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196122927] [2023-11-12 02:13:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:45,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:46,515 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-12 02:13:46,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:46,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196122927] [2023-11-12 02:13:46,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196122927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:46,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:46,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:13:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579248220] [2023-11-12 02:13:46,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:46,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:13:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:13:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:13:46,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 261 [2023-11-12 02:13:46,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:46,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:46,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 261 [2023-11-12 02:13:46,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:47,258 INFO L124 PetriNetUnfolderBase]: 1115/1769 cut-off events. [2023-11-12 02:13:47,259 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-11-12 02:13:47,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 1769 events. 1115/1769 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8905 event pairs, 140 based on Foata normal form. 160/1929 useless extension candidates. Maximal degree in co-relation 3924. Up to 1118 conditions per place. [2023-11-12 02:13:47,272 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 36 selfloop transitions, 4 changer transitions 2/45 dead transitions. [2023-11-12 02:13:47,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 200 flow [2023-11-12 02:13:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:13:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:13:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-11-12 02:13:47,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2023-11-12 02:13:47,276 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-11-12 02:13:47,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-11-12 02:13:47,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:47,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-11-12 02:13:47,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:47,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:47,285 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:47,285 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 93 flow. Second operand 6 states and 667 transitions. [2023-11-12 02:13:47,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 200 flow [2023-11-12 02:13:47,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:13:47,292 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 72 flow [2023-11-12 02:13:47,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2023-11-12 02:13:47,294 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-11-12 02:13:47,294 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 72 flow [2023-11-12 02:13:47,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:47,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:47,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:47,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:13:47,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:47,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -114370570, now seen corresponding path program 1 times [2023-11-12 02:13:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:47,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540684915] [2023-11-12 02:13:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:47,763 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-12 02:13:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:47,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540684915] [2023-11-12 02:13:47,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540684915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:47,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:47,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:13:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238551564] [2023-11-12 02:13:47,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:47,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:13:47,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:47,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:13:47,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:13:47,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 261 [2023-11-12 02:13:47,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:47,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:47,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 261 [2023-11-12 02:13:47,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:48,335 INFO L124 PetriNetUnfolderBase]: 1431/2145 cut-off events. [2023-11-12 02:13:48,335 INFO L125 PetriNetUnfolderBase]: For 600/600 co-relation queries the response was YES. [2023-11-12 02:13:48,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 2145 events. 1431/2145 cut-off events. For 600/600 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9970 event pairs, 375 based on Foata normal form. 96/2240 useless extension candidates. Maximal degree in co-relation 4745. Up to 1441 conditions per place. [2023-11-12 02:13:48,350 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 33 selfloop transitions, 2 changer transitions 18/54 dead transitions. [2023-11-12 02:13:48,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 248 flow [2023-11-12 02:13:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:13:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:13:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-11-12 02:13:48,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2023-11-12 02:13:48,354 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-11-12 02:13:48,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-11-12 02:13:48,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:48,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-11-12 02:13:48,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:48,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:48,361 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:48,361 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 72 flow. Second operand 5 states and 585 transitions. [2023-11-12 02:13:48,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 248 flow [2023-11-12 02:13:48,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 231 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-11-12 02:13:48,372 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 71 flow [2023-11-12 02:13:48,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-11-12 02:13:48,373 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-12 02:13:48,373 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 71 flow [2023-11-12 02:13:48,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:48,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:48,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:48,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:13:48,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:48,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -212595065, now seen corresponding path program 1 times [2023-11-12 02:13:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272209775] [2023-11-12 02:13:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:49,344 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-12 02:13:49,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:49,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272209775] [2023-11-12 02:13:49,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272209775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:49,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:49,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122427879] [2023-11-12 02:13:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:49,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:13:49,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:13:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:13:49,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 261 [2023-11-12 02:13:49,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 71 flow. Second operand has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:49,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:49,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 261 [2023-11-12 02:13:49,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:50,240 INFO L124 PetriNetUnfolderBase]: 1996/2959 cut-off events. [2023-11-12 02:13:50,241 INFO L125 PetriNetUnfolderBase]: For 594/594 co-relation queries the response was YES. [2023-11-12 02:13:50,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6833 conditions, 2959 events. 1996/2959 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 13567 event pairs, 317 based on Foata normal form. 92/3051 useless extension candidates. Maximal degree in co-relation 6825. Up to 2038 conditions per place. [2023-11-12 02:13:50,265 INFO L140 encePairwiseOnDemand]: 249/261 looper letters, 62 selfloop transitions, 15 changer transitions 19/96 dead transitions. [2023-11-12 02:13:50,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 96 transitions, 437 flow [2023-11-12 02:13:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:13:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:13:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 930 transitions. [2023-11-12 02:13:50,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4454022988505747 [2023-11-12 02:13:50,270 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 930 transitions. [2023-11-12 02:13:50,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 930 transitions. [2023-11-12 02:13:50,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:50,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 930 transitions. [2023-11-12 02:13:50,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.25) internal successors, (930), 8 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:50,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:50,279 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:50,279 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 71 flow. Second operand 8 states and 930 transitions. [2023-11-12 02:13:50,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 96 transitions, 437 flow [2023-11-12 02:13:50,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 96 transitions, 425 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-12 02:13:50,293 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 168 flow [2023-11-12 02:13:50,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-11-12 02:13:50,294 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-12 02:13:50,294 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 168 flow [2023-11-12 02:13:50,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:50,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:50,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:50,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:13:50,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:50,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash -578159400, now seen corresponding path program 1 times [2023-11-12 02:13:50,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:50,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716335762] [2023-11-12 02:13:50,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:51,345 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-12 02:13:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716335762] [2023-11-12 02:13:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716335762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:51,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:51,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502040289] [2023-11-12 02:13:51,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:51,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:13:51,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:51,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:13:51,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:13:51,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 261 [2023-11-12 02:13:51,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:51,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:51,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 261 [2023-11-12 02:13:51,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:52,524 INFO L124 PetriNetUnfolderBase]: 2194/3251 cut-off events. [2023-11-12 02:13:52,525 INFO L125 PetriNetUnfolderBase]: For 1945/1945 co-relation queries the response was YES. [2023-11-12 02:13:52,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9589 conditions, 3251 events. 2194/3251 cut-off events. For 1945/1945 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 14638 event pairs, 758 based on Foata normal form. 52/3303 useless extension candidates. Maximal degree in co-relation 9578. Up to 2533 conditions per place. [2023-11-12 02:13:52,553 INFO L140 encePairwiseOnDemand]: 250/261 looper letters, 72 selfloop transitions, 32 changer transitions 15/119 dead transitions. [2023-11-12 02:13:52,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 119 transitions, 721 flow [2023-11-12 02:13:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:13:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-12 02:13:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1012 transitions. [2023-11-12 02:13:52,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43082162622392506 [2023-11-12 02:13:52,559 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1012 transitions. [2023-11-12 02:13:52,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1012 transitions. [2023-11-12 02:13:52,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:52,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1012 transitions. [2023-11-12 02:13:52,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:52,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:52,571 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:52,571 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 168 flow. Second operand 9 states and 1012 transitions. [2023-11-12 02:13:52,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 119 transitions, 721 flow [2023-11-12 02:13:52,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 119 transitions, 717 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-12 02:13:52,580 INFO L231 Difference]: Finished difference. Result has 58 places, 67 transitions, 443 flow [2023-11-12 02:13:52,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=443, PETRI_PLACES=58, PETRI_TRANSITIONS=67} [2023-11-12 02:13:52,582 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-11-12 02:13:52,582 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 67 transitions, 443 flow [2023-11-12 02:13:52,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:52,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:52,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:52,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:13:52,583 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:52,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -791357032, now seen corresponding path program 2 times [2023-11-12 02:13:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848152066] [2023-11-12 02:13:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:53,191 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-12 02:13:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:53,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848152066] [2023-11-12 02:13:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848152066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:53,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724192064] [2023-11-12 02:13:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:53,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:13:53,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:13:53,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:13:53,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-11-12 02:13:53,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 67 transitions, 443 flow. Second operand has 7 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:53,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:53,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-11-12 02:13:53,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:54,049 INFO L124 PetriNetUnfolderBase]: 1755/2742 cut-off events. [2023-11-12 02:13:54,049 INFO L125 PetriNetUnfolderBase]: For 5166/5192 co-relation queries the response was YES. [2023-11-12 02:13:54,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10312 conditions, 2742 events. 1755/2742 cut-off events. For 5166/5192 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13762 event pairs, 350 based on Foata normal form. 59/2787 useless extension candidates. Maximal degree in co-relation 10295. Up to 1632 conditions per place. [2023-11-12 02:13:54,077 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 85 selfloop transitions, 35 changer transitions 4/127 dead transitions. [2023-11-12 02:13:54,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 127 transitions, 984 flow [2023-11-12 02:13:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:13:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:13:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 997 transitions. [2023-11-12 02:13:54,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774904214559387 [2023-11-12 02:13:54,086 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 997 transitions. [2023-11-12 02:13:54,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 997 transitions. [2023-11-12 02:13:54,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:54,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 997 transitions. [2023-11-12 02:13:54,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.625) internal successors, (997), 8 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:54,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:54,097 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:54,097 INFO L175 Difference]: Start difference. First operand has 58 places, 67 transitions, 443 flow. Second operand 8 states and 997 transitions. [2023-11-12 02:13:54,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 127 transitions, 984 flow [2023-11-12 02:13:54,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 127 transitions, 955 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-12 02:13:54,124 INFO L231 Difference]: Finished difference. Result has 64 places, 75 transitions, 604 flow [2023-11-12 02:13:54,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=604, PETRI_PLACES=64, PETRI_TRANSITIONS=75} [2023-11-12 02:13:54,128 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-11-12 02:13:54,128 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 75 transitions, 604 flow [2023-11-12 02:13:54,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:54,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:54,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:54,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:13:54,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:54,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1259454264, now seen corresponding path program 1 times [2023-11-12 02:13:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844768261] [2023-11-12 02:13:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:54,591 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-12 02:13:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844768261] [2023-11-12 02:13:54,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844768261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:54,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:54,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:54,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800179069] [2023-11-12 02:13:54,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:54,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:13:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:54,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:13:54,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:13:54,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 261 [2023-11-12 02:13:54,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 75 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:54,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:54,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 261 [2023-11-12 02:13:54,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:55,940 INFO L124 PetriNetUnfolderBase]: 3153/4761 cut-off events. [2023-11-12 02:13:55,940 INFO L125 PetriNetUnfolderBase]: For 15375/15517 co-relation queries the response was YES. [2023-11-12 02:13:55,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19999 conditions, 4761 events. 3153/4761 cut-off events. For 15375/15517 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 25122 event pairs, 280 based on Foata normal form. 192/4947 useless extension candidates. Maximal degree in co-relation 19980. Up to 2492 conditions per place. [2023-11-12 02:13:55,981 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 116 selfloop transitions, 16 changer transitions 39/175 dead transitions. [2023-11-12 02:13:55,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 175 transitions, 1700 flow [2023-11-12 02:13:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:13:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:13:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 799 transitions. [2023-11-12 02:13:55,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373289545703339 [2023-11-12 02:13:55,985 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 799 transitions. [2023-11-12 02:13:55,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 799 transitions. [2023-11-12 02:13:55,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:55,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 799 transitions. [2023-11-12 02:13:55,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:55,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:55,994 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:55,994 INFO L175 Difference]: Start difference. First operand has 64 places, 75 transitions, 604 flow. Second operand 7 states and 799 transitions. [2023-11-12 02:13:55,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 175 transitions, 1700 flow [2023-11-12 02:13:56,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 175 transitions, 1593 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-11-12 02:13:56,057 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 686 flow [2023-11-12 02:13:56,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=686, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2023-11-12 02:13:56,058 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-11-12 02:13:56,058 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 686 flow [2023-11-12 02:13:56,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:56,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:56,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:56,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:13:56,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:56,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash -385496846, now seen corresponding path program 2 times [2023-11-12 02:13:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:56,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038089059] [2023-11-12 02:13:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:56,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:56,252 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-12 02:13:56,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038089059] [2023-11-12 02:13:56,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038089059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:56,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:56,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:13:56,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597064177] [2023-11-12 02:13:56,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:56,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:13:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:56,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:13:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:13:56,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 261 [2023-11-12 02:13:56,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:56,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:56,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 261 [2023-11-12 02:13:56,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:56,768 INFO L124 PetriNetUnfolderBase]: 1117/1884 cut-off events. [2023-11-12 02:13:56,769 INFO L125 PetriNetUnfolderBase]: For 7137/7200 co-relation queries the response was YES. [2023-11-12 02:13:56,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8122 conditions, 1884 events. 1117/1884 cut-off events. For 7137/7200 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10096 event pairs, 245 based on Foata normal form. 170/2011 useless extension candidates. Maximal degree in co-relation 8098. Up to 1394 conditions per place. [2023-11-12 02:13:56,787 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 89 selfloop transitions, 4 changer transitions 5/106 dead transitions. [2023-11-12 02:13:56,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 1032 flow [2023-11-12 02:13:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:13:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:13:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-12 02:13:56,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49169859514687103 [2023-11-12 02:13:56,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-12 02:13:56,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-12 02:13:56,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:56,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-12 02:13:56,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:56,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:56,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:56,795 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 686 flow. Second operand 3 states and 385 transitions. [2023-11-12 02:13:56,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 1032 flow [2023-11-12 02:13:56,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 106 transitions, 1028 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:13:56,817 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 633 flow [2023-11-12 02:13:56,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2023-11-12 02:13:56,818 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-11-12 02:13:56,818 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 77 transitions, 633 flow [2023-11-12 02:13:56,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:56,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:56,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:56,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:13:56,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:56,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash 70102993, now seen corresponding path program 1 times [2023-11-12 02:13:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534692814] [2023-11-12 02:13:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:57,041 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-12 02:13:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:57,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534692814] [2023-11-12 02:13:57,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534692814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:57,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:57,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:13:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089195688] [2023-11-12 02:13:57,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:57,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:13:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:57,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:13:57,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:13:57,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 261 [2023-11-12 02:13:57,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 77 transitions, 633 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:57,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 261 [2023-11-12 02:13:57,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:57,353 INFO L124 PetriNetUnfolderBase]: 533/982 cut-off events. [2023-11-12 02:13:57,353 INFO L125 PetriNetUnfolderBase]: For 3593/3630 co-relation queries the response was YES. [2023-11-12 02:13:57,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4535 conditions, 982 events. 533/982 cut-off events. For 3593/3630 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4928 event pairs, 102 based on Foata normal form. 129/1093 useless extension candidates. Maximal degree in co-relation 4511. Up to 371 conditions per place. [2023-11-12 02:13:57,361 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 93 selfloop transitions, 7 changer transitions 6/114 dead transitions. [2023-11-12 02:13:57,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 1101 flow [2023-11-12 02:13:57,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:13:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:13:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-11-12 02:13:57,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49233716475095785 [2023-11-12 02:13:57,365 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-11-12 02:13:57,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-11-12 02:13:57,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:57,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-11-12 02:13:57,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,371 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,371 INFO L175 Difference]: Start difference. First operand has 71 places, 77 transitions, 633 flow. Second operand 4 states and 514 transitions. [2023-11-12 02:13:57,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 1101 flow [2023-11-12 02:13:57,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 1059 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-12 02:13:57,384 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 584 flow [2023-11-12 02:13:57,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=584, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-11-12 02:13:57,385 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-11-12 02:13:57,386 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 584 flow [2023-11-12 02:13:57,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:57,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:57,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:13:57,387 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:57,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1411635644, now seen corresponding path program 1 times [2023-11-12 02:13:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623173011] [2023-11-12 02:13:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:57,628 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-12 02:13:57,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:57,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623173011] [2023-11-12 02:13:57,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623173011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:57,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:57,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:13:57,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385845040] [2023-11-12 02:13:57,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:57,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:13:57,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:57,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:13:57,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:13:57,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 261 [2023-11-12 02:13:57,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:57,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 261 [2023-11-12 02:13:57,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:57,884 INFO L124 PetriNetUnfolderBase]: 462/836 cut-off events. [2023-11-12 02:13:57,884 INFO L125 PetriNetUnfolderBase]: For 3375/3401 co-relation queries the response was YES. [2023-11-12 02:13:57,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3943 conditions, 836 events. 462/836 cut-off events. For 3375/3401 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4158 event pairs, 92 based on Foata normal form. 45/865 useless extension candidates. Maximal degree in co-relation 3920. Up to 371 conditions per place. [2023-11-12 02:13:57,890 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 64 selfloop transitions, 10 changer transitions 33/112 dead transitions. [2023-11-12 02:13:57,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 112 transitions, 1063 flow [2023-11-12 02:13:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:13:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:13:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2023-11-12 02:13:57,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2023-11-12 02:13:57,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2023-11-12 02:13:57,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2023-11-12 02:13:57,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:57,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2023-11-12 02:13:57,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,903 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 584 flow. Second operand 5 states and 630 transitions. [2023-11-12 02:13:57,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 112 transitions, 1063 flow [2023-11-12 02:13:57,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 1004 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-11-12 02:13:57,919 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 381 flow [2023-11-12 02:13:57,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-11-12 02:13:57,921 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-11-12 02:13:57,921 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 381 flow [2023-11-12 02:13:57,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:57,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:57,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:57,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:13:57,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:57,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2121509966, now seen corresponding path program 1 times [2023-11-12 02:13:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:57,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462409739] [2023-11-12 02:13:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:58,420 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-12 02:13:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462409739] [2023-11-12 02:13:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462409739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:58,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536820299] [2023-11-12 02:13:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:13:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:13:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:13:58,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 261 [2023-11-12 02:13:58,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:58,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:13:58,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 261 [2023-11-12 02:13:58,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:13:58,936 INFO L124 PetriNetUnfolderBase]: 408/764 cut-off events. [2023-11-12 02:13:58,936 INFO L125 PetriNetUnfolderBase]: For 2492/2506 co-relation queries the response was YES. [2023-11-12 02:13:58,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 764 events. 408/764 cut-off events. For 2492/2506 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3457 event pairs, 82 based on Foata normal form. 15/779 useless extension candidates. Maximal degree in co-relation 3421. Up to 480 conditions per place. [2023-11-12 02:13:58,941 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 44 selfloop transitions, 3 changer transitions 58/106 dead transitions. [2023-11-12 02:13:58,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 944 flow [2023-11-12 02:13:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:13:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:13:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 786 transitions. [2023-11-12 02:13:58,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4302134646962233 [2023-11-12 02:13:58,945 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 786 transitions. [2023-11-12 02:13:58,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 786 transitions. [2023-11-12 02:13:58,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:13:58,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 786 transitions. [2023-11-12 02:13:58,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:58,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:58,952 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:58,953 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 381 flow. Second operand 7 states and 786 transitions. [2023-11-12 02:13:58,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 944 flow [2023-11-12 02:13:58,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 856 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-11-12 02:13:58,963 INFO L231 Difference]: Finished difference. Result has 71 places, 38 transitions, 239 flow [2023-11-12 02:13:58,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=71, PETRI_TRANSITIONS=38} [2023-11-12 02:13:58,965 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-11-12 02:13:58,965 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 38 transitions, 239 flow [2023-11-12 02:13:58,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:13:58,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:13:58,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:58,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:13:58,966 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:13:58,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1795494058, now seen corresponding path program 2 times [2023-11-12 02:13:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:58,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897816784] [2023-11-12 02:13:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:00,937 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-12 02:14:00,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:00,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897816784] [2023-11-12 02:14:00,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897816784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:00,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:00,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:14:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381997678] [2023-11-12 02:14:00,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:00,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:14:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:14:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:14:01,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-11-12 02:14:01,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 38 transitions, 239 flow. Second operand has 10 states, 10 states have (on average 115.2) internal successors, (1152), 10 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:14:01,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:14:01,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-11-12 02:14:01,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:14:01,609 INFO L124 PetriNetUnfolderBase]: 228/454 cut-off events. [2023-11-12 02:14:01,610 INFO L125 PetriNetUnfolderBase]: For 1003/1006 co-relation queries the response was YES. [2023-11-12 02:14:01,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1905 conditions, 454 events. 228/454 cut-off events. For 1003/1006 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1912 event pairs, 35 based on Foata normal form. 3/453 useless extension candidates. Maximal degree in co-relation 1884. Up to 192 conditions per place. [2023-11-12 02:14:01,612 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 37 selfloop transitions, 5 changer transitions 27/71 dead transitions. [2023-11-12 02:14:01,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 558 flow [2023-11-12 02:14:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:14:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:14:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2023-11-12 02:14:01,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45867542419266555 [2023-11-12 02:14:01,618 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2023-11-12 02:14:01,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2023-11-12 02:14:01,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:14:01,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2023-11-12 02:14:01,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:14:01,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:14:01,626 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:14:01,627 INFO L175 Difference]: Start difference. First operand has 71 places, 38 transitions, 239 flow. Second operand 7 states and 838 transitions. [2023-11-12 02:14:01,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 558 flow [2023-11-12 02:14:01,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 522 flow, removed 10 selfloop flow, removed 10 redundant places. [2023-11-12 02:14:01,633 INFO L231 Difference]: Finished difference. Result has 63 places, 36 transitions, 217 flow [2023-11-12 02:14:01,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=63, PETRI_TRANSITIONS=36} [2023-11-12 02:14:01,634 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-11-12 02:14:01,634 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 36 transitions, 217 flow [2023-11-12 02:14:01,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.2) internal successors, (1152), 10 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:14:01,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:14:01,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:01,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:14:01,636 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:14:01,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -221093720, now seen corresponding path program 3 times [2023-11-12 02:14:01,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:01,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195613393] [2023-11-12 02:14:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:01,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:01,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:01,809 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:14:01,810 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-12 02:14:01,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-12 02:14:01,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-12 02:14:01,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-12 02:14:01,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-12 02:14:01,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-12 02:14:01,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-12 02:14:01,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-12 02:14:01,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-12 02:14:01,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-12 02:14:01,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-12 02:14:01,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-12 02:14:01,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-12 02:14:01,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:14:01,815 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:01,822 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:14:01,822 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:14:01,895 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:14:01,898 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:14:01,900 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:14:01,920 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:14:01,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:14:01 BasicIcfg [2023-11-12 02:14:01,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:14:01,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:14:01,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:14:01,947 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:14:01,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:35" (3/4) ... [2023-11-12 02:14:01,949 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:14:01,950 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:14:01,951 INFO L158 Benchmark]: Toolchain (without parser) took 27877.35ms. Allocated memory was 136.3MB in the beginning and 488.6MB in the end (delta: 352.3MB). Free memory was 88.9MB in the beginning and 318.6MB in the end (delta: -229.8MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. [2023-11-12 02:14:01,951 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 64.3MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:14:01,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.59ms. Allocated memory is still 136.3MB. Free memory was 88.9MB in the beginning and 103.6MB in the end (delta: -14.7MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2023-11-12 02:14:01,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 136.3MB. Free memory was 103.6MB in the beginning and 100.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:14:01,953 INFO L158 Benchmark]: Boogie Preprocessor took 32.74ms. Allocated memory is still 136.3MB. Free memory was 100.3MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:14:01,953 INFO L158 Benchmark]: RCFGBuilder took 1000.18ms. Allocated memory is still 136.3MB. Free memory was 98.2MB in the beginning and 58.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-12 02:14:01,953 INFO L158 Benchmark]: TraceAbstraction took 26066.65ms. Allocated memory was 136.3MB in the beginning and 488.6MB in the end (delta: 352.3MB). Free memory was 57.5MB in the beginning and 318.6MB in the end (delta: -261.2MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2023-11-12 02:14:01,954 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 488.6MB. Free memory is still 318.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:14:01,956 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 94.4MB. Free memory was 64.3MB in the beginning and 64.3MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.59ms. Allocated memory is still 136.3MB. Free memory was 88.9MB in the beginning and 103.6MB in the end (delta: -14.7MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 136.3MB. Free memory was 103.6MB in the beginning and 100.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.74ms. Allocated memory is still 136.3MB. Free memory was 100.3MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1000.18ms. Allocated memory is still 136.3MB. Free memory was 98.2MB in the beginning and 58.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26066.65ms. Allocated memory was 136.3MB in the beginning and 488.6MB in the end (delta: 352.3MB). Free memory was 57.5MB in the beginning and 318.6MB in the end (delta: -261.2MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 488.6MB. Free memory is still 318.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 138 PlacesBefore, 44 PlacesAfterwards, 131 TransitionsBefore, 35 TransitionsAfterwards, 3010 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 127 TotalNumberOfCompositions, 8198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3945, independent: 3728, independent conditional: 0, independent unconditional: 3728, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1587, independent: 1552, independent conditional: 0, independent unconditional: 1552, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3945, independent: 2176, independent conditional: 0, independent unconditional: 2176, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1587, unknown conditional: 0, unknown unconditional: 1587] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L873] 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", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, 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: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: 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: 845]: 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: 841]: 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, 164 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: 25.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 998 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 783 mSDsluCounter, 700 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 593 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2360 IncrementalHoareTripleChecker+Invalid, 2528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 107 mSDtfsCounter, 2360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=9, InterpolantAutomatonStates: 79, 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.5s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 2582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-12 02:14:02,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/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_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:14:04,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:14:04,783 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-12 02:14:04,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:14:04,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:14:04,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:14:04,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:14:04,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:14:04,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:14:04,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:14:04,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:14:04,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:14:04,851 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:14:04,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:14:04,853 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:14:04,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:14:04,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:14:04,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:14:04,855 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:14:04,857 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:14:04,857 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:14:04,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:14:04,858 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:14:04,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:14:04,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:14:04,860 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:14:04,860 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:14:04,861 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:14:04,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:14:04,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:14:04,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:14:04,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:04,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:14:04,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:14:04,865 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:14:04,866 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:14:04,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:14:04,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:14:04,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:14:04,868 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:14:04,868 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:14:04,868 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_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/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_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-11-12 02:14:05,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:14:05,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:14:05,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:14:05,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:14:05,300 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:14:05,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-12 02:14:08,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:14:08,830 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:14:08,830 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-12 02:14:08,858 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/data/606c7ff77/29880131b46d4059990dd86accb8e3d6/FLAGdbece902f [2023-11-12 02:14:08,872 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/data/606c7ff77/29880131b46d4059990dd86accb8e3d6 [2023-11-12 02:14:08,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:14:08,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:14:08,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:08,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:14:08,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:14:08,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:08" (1/1) ... [2023-11-12 02:14:08,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582f8e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:08, skipping insertion in model container [2023-11-12 02:14:08,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:08" (1/1) ... [2023-11-12 02:14:08,950 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:14:09,443 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:09,474 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:14:09,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:09,698 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:14:09,698 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:14:09,706 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:14:09,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09 WrapperNode [2023-11-12 02:14:09,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:09,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:09,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:14:09,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:14:09,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,871 INFO L138 Inliner]: procedures = 179, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2023-11-12 02:14:09,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:09,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:14:09,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:14:09,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:14:09,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:14:09,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:14:09,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:14:09,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:14:09,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (1/1) ... [2023-11-12 02:14:09,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:09,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:09,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:10,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_977e34e5-d05f-4c55-9ffa-9f1a611810c5/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:14:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:14:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:14:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:14:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:14:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 02:14:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:14:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:14:10,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:14:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:14:10,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:14:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:14:10,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:14:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:14:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:14:10,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:14:10,051 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:14:10,265 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:14:10,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:14:10,776 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:14:10,998 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:14:10,999 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:14:11,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:11 BoogieIcfgContainer [2023-11-12 02:14:11,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:14:11,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:14:11,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:14:11,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:14:11,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:14:08" (1/3) ... [2023-11-12 02:14:11,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9e390f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:11, skipping insertion in model container [2023-11-12 02:14:11,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:09" (2/3) ... [2023-11-12 02:14:11,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9e390f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:11, skipping insertion in model container [2023-11-12 02:14:11,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:11" (3/3) ... [2023-11-12 02:14:11,015 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-11-12 02:14:11,036 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:14:11,037 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 02:14:11,037 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:14:11,127 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:14:11,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 135 transitions, 282 flow [2023-11-12 02:14:11,280 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-11-12 02:14:11,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:14:11,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-12 02:14:11,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 135 transitions, 282 flow [2023-11-12 02:14:11,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 132 transitions, 273 flow [2023-11-12 02:14:11,313 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:14:11,327 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 132 transitions, 273 flow [2023-11-12 02:14:11,333 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 132 transitions, 273 flow [2023-11-12 02:14:11,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 132 transitions, 273 flow [2023-11-12 02:14:11,409 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-11-12 02:14:11,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:14:11,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-12 02:14:11,417 INFO L119 LiptonReduction]: Number of co-enabled transitions 3010