./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:26:54,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:26:54,961 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:26:54,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:26:54,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:26:55,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:26:55,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:26:55,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:26:55,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:26:55,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:26:55,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:26:55,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:26:55,049 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:26:55,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:26:55,050 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:26:55,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:26:55,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:26:55,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:26:55,053 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:26:55,053 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:26:55,054 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:26:55,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:26:55,055 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:26:55,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:26:55,056 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:26:55,056 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:26:55,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:26:55,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:26:55,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:26:55,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:26:55,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:26:55,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:26:55,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:26:55,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:26:55,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:26:55,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:26:55,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:26:55,061 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:26:55,062 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_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2023-11-06 22:26:55,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:26:55,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:26:55,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:26:55,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:26:55,408 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:26:55,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 22:26:58,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:26:59,116 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:26:59,117 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 22:26:59,140 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/data/46d43b7d4/efeb2c5003a34de9a1dffb5db437d728/FLAGab591249c [2023-11-06 22:26:59,157 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/data/46d43b7d4/efeb2c5003a34de9a1dffb5db437d728 [2023-11-06 22:26:59,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:26:59,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:26:59,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:59,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:26:59,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:26:59,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59454b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59, skipping insertion in model container [2023-11-06 22:26:59,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:26:59,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:59,682 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:26:59,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:59,792 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:26:59,793 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:26:59,802 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:26:59,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59 WrapperNode [2023-11-06 22:26:59,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:59,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:59,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:26:59,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:26:59,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,873 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2023-11-06 22:26:59,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:59,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:26:59,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:26:59,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:26:59,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:26:59,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:26:59,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:26:59,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:26:59,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (1/1) ... [2023-11-06 22:26:59,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:26:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:00,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:27:00,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:27:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:27:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:27:00,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:27:00,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:27:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:27:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:27:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:27:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:27:00,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:27:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:27:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:27:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:27:00,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:27:00,070 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:27:00,231 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:27:00,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:27:00,625 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:27:00,850 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:27:00,851 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:27:00,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:00 BoogieIcfgContainer [2023-11-06 22:27:00,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:27:00,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:27:00,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:27:00,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:27:00,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:59" (1/3) ... [2023-11-06 22:27:00,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73744e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:00, skipping insertion in model container [2023-11-06 22:27:00,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:59" (2/3) ... [2023-11-06 22:27:00,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73744e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:00, skipping insertion in model container [2023-11-06 22:27:00,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:00" (3/3) ... [2023-11-06 22:27:00,866 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 22:27:00,887 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:27:00,887 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-06 22:27:00,887 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:27:00,947 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:27:00,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 107 transitions, 222 flow [2023-11-06 22:27:01,049 INFO L124 PetriNetUnfolderBase]: 3/105 cut-off events. [2023-11-06 22:27:01,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:01,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-11-06 22:27:01,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 107 transitions, 222 flow [2023-11-06 22:27:01,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 105 transitions, 216 flow [2023-11-06 22:27:01,065 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:27:01,078 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 105 transitions, 216 flow [2023-11-06 22:27:01,081 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 105 transitions, 216 flow [2023-11-06 22:27:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 216 flow [2023-11-06 22:27:01,114 INFO L124 PetriNetUnfolderBase]: 3/105 cut-off events. [2023-11-06 22:27:01,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:01,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-11-06 22:27:01,117 INFO L119 LiptonReduction]: Number of co-enabled transitions 1592 [2023-11-06 22:27:07,042 INFO L134 LiptonReduction]: Checked pairs total: 4238 [2023-11-06 22:27:07,042 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-11-06 22:27:07,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:27:07,071 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;@a3f0c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:27:07,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-06 22:27:07,074 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:27:07,074 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:27:07,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:07,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:07,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:27:07,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:07,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash 500, now seen corresponding path program 1 times [2023-11-06 22:27:07,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:07,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132067244] [2023-11-06 22:27:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:07,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:07,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132067244] [2023-11-06 22:27:07,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132067244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:07,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:07,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:27:07,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076691745] [2023-11-06 22:27:07,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:07,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:27:07,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:07,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:27:07,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:27:07,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 216 [2023-11-06 22:27:07,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:07,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:07,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 216 [2023-11-06 22:27:07,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:07,562 INFO L124 PetriNetUnfolderBase]: 235/412 cut-off events. [2023-11-06 22:27:07,562 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:27:07,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 412 events. 235/412 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1749 event pairs, 235 based on Foata normal form. 20/327 useless extension candidates. Maximal degree in co-relation 820. Up to 405 conditions per place. [2023-11-06 22:27:07,572 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-11-06 22:27:07,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 84 flow [2023-11-06 22:27:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:27:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:27:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 213 transitions. [2023-11-06 22:27:07,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2023-11-06 22:27:07,597 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 213 transitions. [2023-11-06 22:27:07,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 213 transitions. [2023-11-06 22:27:07,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:07,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 213 transitions. [2023-11-06 22:27:07,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:07,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:07,622 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:07,625 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 213 transitions. [2023-11-06 22:27:07,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 84 flow [2023-11-06 22:27:07,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:07,632 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-11-06 22:27:07,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-11-06 22:27:07,641 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-11-06 22:27:07,642 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-11-06 22:27:07,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:07,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:07,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:27:07,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:27:07,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:07,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash 473823002, now seen corresponding path program 1 times [2023-11-06 22:27:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:07,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899600761] [2023-11-06 22:27:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899600761] [2023-11-06 22:27:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899600761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:27:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353463267] [2023-11-06 22:27:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:08,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:27:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:08,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:27:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:27:08,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 216 [2023-11-06 22:27:08,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:08,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:08,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 216 [2023-11-06 22:27:08,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:08,299 INFO L124 PetriNetUnfolderBase]: 183/386 cut-off events. [2023-11-06 22:27:08,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:08,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 386 events. 183/386 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1867 event pairs, 27 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 716. Up to 253 conditions per place. [2023-11-06 22:27:08,309 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 21 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2023-11-06 22:27:08,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 118 flow [2023-11-06 22:27:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:27:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:27:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-11-06 22:27:08,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2023-11-06 22:27:08,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-11-06 22:27:08,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-11-06 22:27:08,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:08,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-11-06 22:27:08,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:08,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:08,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:08,330 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 310 transitions. [2023-11-06 22:27:08,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 118 flow [2023-11-06 22:27:08,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:27:08,336 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-11-06 22:27:08,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-11-06 22:27:08,338 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-11-06 22:27:08,338 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-11-06 22:27:08,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:08,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:08,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:08,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:27:08,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:08,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1893574149, now seen corresponding path program 1 times [2023-11-06 22:27:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:08,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80435777] [2023-11-06 22:27:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:08,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80435777] [2023-11-06 22:27:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80435777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:08,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:08,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:27:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536503128] [2023-11-06 22:27:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:08,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:09,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 216 [2023-11-06 22:27:09,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:09,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 216 [2023-11-06 22:27:09,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:09,222 INFO L124 PetriNetUnfolderBase]: 142/258 cut-off events. [2023-11-06 22:27:09,222 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:27:09,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 258 events. 142/258 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 944 event pairs, 114 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 540. Up to 246 conditions per place. [2023-11-06 22:27:09,225 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 16 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-11-06 22:27:09,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 84 flow [2023-11-06 22:27:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:27:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2023-11-06 22:27:09,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2023-11-06 22:27:09,228 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 351 transitions. [2023-11-06 22:27:09,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 351 transitions. [2023-11-06 22:27:09,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:09,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 351 transitions. [2023-11-06 22:27:09,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,234 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,235 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 4 states and 351 transitions. [2023-11-06 22:27:09,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 84 flow [2023-11-06 22:27:09,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:09,236 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-11-06 22:27:09,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-11-06 22:27:09,238 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2023-11-06 22:27:09,238 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-11-06 22:27:09,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:09,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:09,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:27:09,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:09,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:09,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1893574175, now seen corresponding path program 1 times [2023-11-06 22:27:09,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:09,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826858606] [2023-11-06 22:27:09,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:09,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:09,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826858606] [2023-11-06 22:27:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826858606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:09,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:27:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739585476] [2023-11-06 22:27:09,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:09,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:09,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:09,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:09,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 216 [2023-11-06 22:27:09,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:09,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 216 [2023-11-06 22:27:09,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:09,580 INFO L124 PetriNetUnfolderBase]: 133/264 cut-off events. [2023-11-06 22:27:09,580 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:27:09,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 264 events. 133/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1052 event pairs, 45 based on Foata normal form. 20/283 useless extension candidates. Maximal degree in co-relation 525. Up to 146 conditions per place. [2023-11-06 22:27:09,583 INFO L140 encePairwiseOnDemand]: 212/216 looper letters, 18 selfloop transitions, 2 changer transitions 11/33 dead transitions. [2023-11-06 22:27:09,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 136 flow [2023-11-06 22:27:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:27:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:27:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-11-06 22:27:09,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2023-11-06 22:27:09,586 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-11-06 22:27:09,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-11-06 22:27:09,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:09,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-11-06 22:27:09,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,594 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,595 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 488 transitions. [2023-11-06 22:27:09,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 136 flow [2023-11-06 22:27:09,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:09,596 INFO L231 Difference]: Finished difference. Result has 31 places, 17 transitions, 51 flow [2023-11-06 22:27:09,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=51, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2023-11-06 22:27:09,598 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-06 22:27:09,598 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 51 flow [2023-11-06 22:27:09,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:09,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:09,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:27:09,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:09,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 97892170, now seen corresponding path program 1 times [2023-11-06 22:27:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646751795] [2023-11-06 22:27:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646751795] [2023-11-06 22:27:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646751795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:10,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:10,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:27:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613490624] [2023-11-06 22:27:10,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:10,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:27:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:27:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:27:10,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 216 [2023-11-06 22:27:10,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 51 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:10,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:10,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 216 [2023-11-06 22:27:10,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:10,764 INFO L124 PetriNetUnfolderBase]: 127/269 cut-off events. [2023-11-06 22:27:10,765 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-06 22:27:10,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 269 events. 127/269 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1067 event pairs, 53 based on Foata normal form. 15/284 useless extension candidates. Maximal degree in co-relation 597. Up to 188 conditions per place. [2023-11-06 22:27:10,768 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 22 selfloop transitions, 5 changer transitions 10/39 dead transitions. [2023-11-06 22:27:10,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 174 flow [2023-11-06 22:27:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:27:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:27:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2023-11-06 22:27:10,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2023-11-06 22:27:10,774 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 585 transitions. [2023-11-06 22:27:10,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 585 transitions. [2023-11-06 22:27:10,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:10,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 585 transitions. [2023-11-06 22:27:10,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.5) internal successors, (585), 6 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-06 22:27:10,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:10,786 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:10,787 INFO L175 Difference]: Start difference. First operand has 31 places, 17 transitions, 51 flow. Second operand 6 states and 585 transitions. [2023-11-06 22:27:10,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 174 flow [2023-11-06 22:27:10,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 166 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:27:10,794 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 81 flow [2023-11-06 22:27:10,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2023-11-06 22:27:10,799 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-11-06 22:27:10,799 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 81 flow [2023-11-06 22:27:10,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:10,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:10,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:10,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:27:10,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:10,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2089880069, now seen corresponding path program 1 times [2023-11-06 22:27:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:10,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514645485] [2023-11-06 22:27:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:11,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:11,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514645485] [2023-11-06 22:27:11,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514645485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:27:11,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128861045] [2023-11-06 22:27:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:11,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:27:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:27:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:27:11,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 216 [2023-11-06 22:27:11,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 81 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:11,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:11,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 216 [2023-11-06 22:27:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:11,937 INFO L124 PetriNetUnfolderBase]: 106/207 cut-off events. [2023-11-06 22:27:11,937 INFO L125 PetriNetUnfolderBase]: For 102/112 co-relation queries the response was YES. [2023-11-06 22:27:11,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 207 events. 106/207 cut-off events. For 102/112 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 704 event pairs, 37 based on Foata normal form. 4/201 useless extension candidates. Maximal degree in co-relation 556. Up to 170 conditions per place. [2023-11-06 22:27:11,940 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 23 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-11-06 22:27:11,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 193 flow [2023-11-06 22:27:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:27:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:27:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2023-11-06 22:27:11,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2023-11-06 22:27:11,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 543 transitions. [2023-11-06 22:27:11,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 543 transitions. [2023-11-06 22:27:11,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:11,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 543 transitions. [2023-11-06 22:27:11,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:11,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:11,954 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:11,954 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 81 flow. Second operand 6 states and 543 transitions. [2023-11-06 22:27:11,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 193 flow [2023-11-06 22:27:11,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 191 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:27:11,959 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 148 flow [2023-11-06 22:27:11,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-06 22:27:11,963 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-11-06 22:27:11,967 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 148 flow [2023-11-06 22:27:11,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:11,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:11,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:11,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:27:11,971 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:11,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1809528189, now seen corresponding path program 2 times [2023-11-06 22:27:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636129194] [2023-11-06 22:27:11,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:12,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:12,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636129194] [2023-11-06 22:27:12,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636129194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:12,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:12,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:27:12,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674082328] [2023-11-06 22:27:12,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:12,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:27:12,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:12,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:27:12,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:27:12,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 216 [2023-11-06 22:27:12,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:12,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:12,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 216 [2023-11-06 22:27:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:13,167 INFO L124 PetriNetUnfolderBase]: 90/193 cut-off events. [2023-11-06 22:27:13,167 INFO L125 PetriNetUnfolderBase]: For 213/217 co-relation queries the response was YES. [2023-11-06 22:27:13,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 193 events. 90/193 cut-off events. For 213/217 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 680 event pairs, 24 based on Foata normal form. 10/203 useless extension candidates. Maximal degree in co-relation 619. Up to 142 conditions per place. [2023-11-06 22:27:13,170 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 24 selfloop transitions, 15 changer transitions 3/44 dead transitions. [2023-11-06 22:27:13,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 305 flow [2023-11-06 22:27:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:27:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:27:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 815 transitions. [2023-11-06 22:27:13,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.419238683127572 [2023-11-06 22:27:13,176 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 815 transitions. [2023-11-06 22:27:13,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 815 transitions. [2023-11-06 22:27:13,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:13,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 815 transitions. [2023-11-06 22:27:13,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:13,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:13,186 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:13,187 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 148 flow. Second operand 9 states and 815 transitions. [2023-11-06 22:27:13,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 305 flow [2023-11-06 22:27:13,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 297 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-11-06 22:27:13,192 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 214 flow [2023-11-06 22:27:13,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2023-11-06 22:27:13,193 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2023-11-06 22:27:13,193 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 214 flow [2023-11-06 22:27:13,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:13,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:13,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:13,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:27:13,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:13,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2063241897, now seen corresponding path program 1 times [2023-11-06 22:27:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352520758] [2023-11-06 22:27:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352520758] [2023-11-06 22:27:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352520758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:14,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:27:14,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619451699] [2023-11-06 22:27:14,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:14,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:27:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:14,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:27:14,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:27:14,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 216 [2023-11-06 22:27:14,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 81.25) internal successors, (650), 8 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:14,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:14,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 216 [2023-11-06 22:27:14,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:15,458 INFO L124 PetriNetUnfolderBase]: 120/253 cut-off events. [2023-11-06 22:27:15,458 INFO L125 PetriNetUnfolderBase]: For 600/608 co-relation queries the response was YES. [2023-11-06 22:27:15,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 253 events. 120/253 cut-off events. For 600/608 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1006 event pairs, 15 based on Foata normal form. 24/277 useless extension candidates. Maximal degree in co-relation 963. Up to 127 conditions per place. [2023-11-06 22:27:15,462 INFO L140 encePairwiseOnDemand]: 206/216 looper letters, 31 selfloop transitions, 25 changer transitions 17/75 dead transitions. [2023-11-06 22:27:15,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 579 flow [2023-11-06 22:27:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:27:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:27:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 948 transitions. [2023-11-06 22:27:15,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2023-11-06 22:27:15,468 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 948 transitions. [2023-11-06 22:27:15,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 948 transitions. [2023-11-06 22:27:15,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:15,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 948 transitions. [2023-11-06 22:27:15,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.18181818181819) internal successors, (948), 11 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:15,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 216.0) internal successors, (2592), 12 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:15,478 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 216.0) internal successors, (2592), 12 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:15,479 INFO L175 Difference]: Start difference. First operand has 51 places, 31 transitions, 214 flow. Second operand 11 states and 948 transitions. [2023-11-06 22:27:15,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 579 flow [2023-11-06 22:27:15,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 553 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-06 22:27:15,486 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 391 flow [2023-11-06 22:27:15,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=391, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-11-06 22:27:15,487 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-11-06 22:27:15,487 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 391 flow [2023-11-06 22:27:15,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.25) internal successors, (650), 8 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:15,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:15,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:15,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:27:15,489 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:15,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash -489894057, now seen corresponding path program 1 times [2023-11-06 22:27:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:15,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825632853] [2023-11-06 22:27:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:16,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:16,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825632853] [2023-11-06 22:27:16,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825632853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:16,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:16,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:27:16,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857317135] [2023-11-06 22:27:16,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:16,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:27:16,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:27:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:27:16,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 216 [2023-11-06 22:27:16,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 391 flow. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:16,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:16,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 216 [2023-11-06 22:27:16,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:16,725 INFO L124 PetriNetUnfolderBase]: 91/207 cut-off events. [2023-11-06 22:27:16,725 INFO L125 PetriNetUnfolderBase]: For 900/910 co-relation queries the response was YES. [2023-11-06 22:27:16,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 207 events. 91/207 cut-off events. For 900/910 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 756 event pairs, 12 based on Foata normal form. 8/215 useless extension candidates. Maximal degree in co-relation 1026. Up to 151 conditions per place. [2023-11-06 22:27:16,728 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 37 selfloop transitions, 17 changer transitions 3/59 dead transitions. [2023-11-06 22:27:16,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 611 flow [2023-11-06 22:27:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:27:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:27:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 806 transitions. [2023-11-06 22:27:16,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41460905349794236 [2023-11-06 22:27:16,733 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 806 transitions. [2023-11-06 22:27:16,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 806 transitions. [2023-11-06 22:27:16,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:16,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 806 transitions. [2023-11-06 22:27:16,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.55555555555556) internal successors, (806), 9 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:16,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:16,743 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:16,743 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 391 flow. Second operand 9 states and 806 transitions. [2023-11-06 22:27:16,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 611 flow [2023-11-06 22:27:16,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 550 flow, removed 24 selfloop flow, removed 5 redundant places. [2023-11-06 22:27:16,752 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 420 flow [2023-11-06 22:27:16,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=420, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2023-11-06 22:27:16,753 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2023-11-06 22:27:16,754 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 420 flow [2023-11-06 22:27:16,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:16,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:16,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:16,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:27:16,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:16,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash -493961493, now seen corresponding path program 1 times [2023-11-06 22:27:16,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:16,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856663898] [2023-11-06 22:27:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:16,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856663898] [2023-11-06 22:27:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856663898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:16,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:27:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68476995] [2023-11-06 22:27:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:16,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:16,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-11-06 22:27:16,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 420 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:16,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:16,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-11-06 22:27:16,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:17,000 INFO L124 PetriNetUnfolderBase]: 23/75 cut-off events. [2023-11-06 22:27:17,001 INFO L125 PetriNetUnfolderBase]: For 468/476 co-relation queries the response was YES. [2023-11-06 22:27:17,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 75 events. 23/75 cut-off events. For 468/476 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 211 event pairs, 6 based on Foata normal form. 21/95 useless extension candidates. Maximal degree in co-relation 369. Up to 31 conditions per place. [2023-11-06 22:27:17,002 INFO L140 encePairwiseOnDemand]: 212/216 looper letters, 31 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-11-06 22:27:17,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 47 transitions, 502 flow [2023-11-06 22:27:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:27:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2023-11-06 22:27:17,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2023-11-06 22:27:17,005 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 392 transitions. [2023-11-06 22:27:17,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 392 transitions. [2023-11-06 22:27:17,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:17,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 392 transitions. [2023-11-06 22:27:17,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:17,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:17,010 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:17,010 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 420 flow. Second operand 4 states and 392 transitions. [2023-11-06 22:27:17,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 47 transitions, 502 flow [2023-11-06 22:27:17,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 418 flow, removed 22 selfloop flow, removed 12 redundant places. [2023-11-06 22:27:17,017 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 355 flow [2023-11-06 22:27:17,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-11-06 22:27:17,019 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2023-11-06 22:27:17,019 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 355 flow [2023-11-06 22:27:17,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:17,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:17,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:17,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:27:17,021 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:17,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1869584042, now seen corresponding path program 1 times [2023-11-06 22:27:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:17,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489060534] [2023-11-06 22:27:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:17,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:17,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489060534] [2023-11-06 22:27:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489060534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:17,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:27:17,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498993467] [2023-11-06 22:27:17,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:17,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:27:17,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:17,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:27:17,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:27:17,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 216 [2023-11-06 22:27:17,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 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-06 22:27:17,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:17,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 216 [2023-11-06 22:27:17,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:17,935 INFO L124 PetriNetUnfolderBase]: 39/115 cut-off events. [2023-11-06 22:27:17,935 INFO L125 PetriNetUnfolderBase]: For 462/463 co-relation queries the response was YES. [2023-11-06 22:27:17,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 115 events. 39/115 cut-off events. For 462/463 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 386 event pairs, 3 based on Foata normal form. 2/117 useless extension candidates. Maximal degree in co-relation 580. Up to 55 conditions per place. [2023-11-06 22:27:17,938 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 24 selfloop transitions, 3 changer transitions 40/70 dead transitions. [2023-11-06 22:27:17,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 729 flow [2023-11-06 22:27:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:27:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:27:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 617 transitions. [2023-11-06 22:27:17,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4080687830687831 [2023-11-06 22:27:17,943 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 617 transitions. [2023-11-06 22:27:17,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 617 transitions. [2023-11-06 22:27:17,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:17,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 617 transitions. [2023-11-06 22:27:17,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:17,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:17,952 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:17,952 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 355 flow. Second operand 7 states and 617 transitions. [2023-11-06 22:27:17,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 729 flow [2023-11-06 22:27:17,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 679 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-11-06 22:27:17,962 INFO L231 Difference]: Finished difference. Result has 61 places, 28 transitions, 217 flow [2023-11-06 22:27:17,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=61, PETRI_TRANSITIONS=28} [2023-11-06 22:27:17,963 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-11-06 22:27:17,963 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 28 transitions, 217 flow [2023-11-06 22:27:17,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 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-06 22:27:17,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:17,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:17,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:27:17,965 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:17,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash -72613564, now seen corresponding path program 2 times [2023-11-06 22:27:17,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:17,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291710552] [2023-11-06 22:27:17,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:17,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:27:18,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:27:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:27:18,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:27:18,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:27:18,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-06 22:27:18,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-06 22:27:18,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-06 22:27:18,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-06 22:27:18,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-06 22:27:18,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-06 22:27:18,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-06 22:27:18,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-06 22:27:18,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-06 22:27:18,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-06 22:27:18,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:27:18,151 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:18,158 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:27:18,159 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:27:18,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:27:18 BasicIcfg [2023-11-06 22:27:18,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:27:18,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:27:18,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:27:18,275 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:27:18,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:00" (3/4) ... [2023-11-06 22:27:18,278 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:27:18,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:27:18,281 INFO L158 Benchmark]: Toolchain (without parser) took 19119.10ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 119.7MB in the beginning and 95.3MB in the end (delta: 24.4MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. [2023-11-06 22:27:18,281 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory was 102.2MB in the beginning and 102.0MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:27:18,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.39ms. Allocated memory is still 155.2MB. Free memory was 119.4MB in the beginning and 96.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:27:18,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.13ms. Allocated memory is still 155.2MB. Free memory was 96.8MB in the beginning and 94.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:27:18,283 INFO L158 Benchmark]: Boogie Preprocessor took 63.94ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:27:18,283 INFO L158 Benchmark]: RCFGBuilder took 914.95ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 92.2MB in the beginning and 141.2MB in the end (delta: -49.0MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2023-11-06 22:27:18,284 INFO L158 Benchmark]: TraceAbstraction took 17416.37ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 141.2MB in the beginning and 95.3MB in the end (delta: 45.9MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. [2023-11-06 22:27:18,284 INFO L158 Benchmark]: Witness Printer took 5.70ms. Allocated memory is still 276.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:27:18,288 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.22ms. Allocated memory is still 155.2MB. Free memory was 102.2MB in the beginning and 102.0MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.39ms. Allocated memory is still 155.2MB. Free memory was 119.4MB in the beginning and 96.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.13ms. Allocated memory is still 155.2MB. Free memory was 96.8MB in the beginning and 94.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.94ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 914.95ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 92.2MB in the beginning and 141.2MB in the end (delta: -49.0MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17416.37ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 141.2MB in the beginning and 95.3MB in the end (delta: 45.9MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. * Witness Printer took 5.70ms. Allocated memory is still 276.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 109 PlacesBefore, 32 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1592 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 4238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2116, independent: 1959, independent conditional: 0, independent unconditional: 1959, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 911, independent: 888, independent conditional: 0, independent unconditional: 888, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2116, independent: 1071, independent conditional: 0, independent unconditional: 1071, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 911, unknown conditional: 0, unknown unconditional: 911] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=0, t1091={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=1, t1091={5:0}, t1092={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L746] 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) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 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 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 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, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 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) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 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 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 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) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 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) [L823] 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)) [L824] 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)) [L825] 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)) [L826] 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)) [L827] 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] 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", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={53:54}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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 5 procedures, 126 locations, 10 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: 17.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 519 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 471 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1277 IncrementalHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 65 mSDtfsCounter, 1277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 1427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:27:18,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:27:21,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:27:21,745 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:27:21,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:27:21,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:27:21,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:27:21,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:27:21,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:27:21,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:27:21,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:27:21,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:27:21,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:27:21,857 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:27:21,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:27:21,860 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:27:21,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:27:21,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:27:21,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:27:21,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:27:21,863 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:27:21,864 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:27:21,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:27:21,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:27:21,866 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:27:21,866 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:27:21,867 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:27:21,868 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:27:21,868 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:27:21,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:27:21,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:27:21,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:27:21,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:21,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:27:21,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:27:21,873 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:27:21,874 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:27:21,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:27:21,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:27:21,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:27:21,876 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:27:21,876 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:27:21,877 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_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2023-11-06 22:27:22,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:27:22,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:27:22,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:27:22,474 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:27:22,475 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:27:22,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 22:27:25,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:27:26,411 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:27:26,420 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 22:27:26,443 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/data/5aa82602f/4344da74f6994f1dafdb29547d13287f/FLAG6c890e53f [2023-11-06 22:27:26,463 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/data/5aa82602f/4344da74f6994f1dafdb29547d13287f [2023-11-06 22:27:26,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:27:26,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:27:26,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:27:26,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:27:26,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:27:26,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:26" (1/1) ... [2023-11-06 22:27:26,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f7f1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:26, skipping insertion in model container [2023-11-06 22:27:26,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:26" (1/1) ... [2023-11-06 22:27:26,570 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:27:27,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:27:27,245 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:27:27,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:27:27,500 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:27,500 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:27,509 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:27:27,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27 WrapperNode [2023-11-06 22:27:27,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:27:27,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:27:27,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:27:27,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:27:27,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,620 INFO L138 Inliner]: procedures = 178, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2023-11-06 22:27:27,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:27:27,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:27:27,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:27:27,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:27:27,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:27:27,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:27:27,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:27:27,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:27:27,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2023-11-06 22:27:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:27,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:27,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:27:27,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:27:27,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:27:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:27:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:27:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:27:27,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:27:27,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:27:27,855 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:27:27,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:27:27,856 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:27:27,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:27:27,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:27:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:27:27,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:27:27,861 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:27:28,124 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:27:28,127 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:27:28,667 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:27:28,842 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:27:28,842 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:27:28,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:28 BoogieIcfgContainer [2023-11-06 22:27:28,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:27:28,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:27:28,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:27:28,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:27:28,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:26" (1/3) ... [2023-11-06 22:27:28,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d69da30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:28, skipping insertion in model container [2023-11-06 22:27:28,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (2/3) ... [2023-11-06 22:27:28,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d69da30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:28, skipping insertion in model container [2023-11-06 22:27:28,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:28" (3/3) ... [2023-11-06 22:27:28,858 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 22:27:28,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:27:28,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-06 22:27:28,880 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:27:28,950 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:27:29,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 108 transitions, 224 flow [2023-11-06 22:27:29,116 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2023-11-06 22:27:29,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:29,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-11-06 22:27:29,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 108 transitions, 224 flow [2023-11-06 22:27:29,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 106 transitions, 218 flow [2023-11-06 22:27:29,139 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:27:29,157 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 106 transitions, 218 flow [2023-11-06 22:27:29,163 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 106 transitions, 218 flow [2023-11-06 22:27:29,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 106 transitions, 218 flow [2023-11-06 22:27:29,229 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2023-11-06 22:27:29,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:29,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-11-06 22:27:29,239 INFO L119 LiptonReduction]: Number of co-enabled transitions 1592 [2023-11-06 22:27:39,326 INFO L134 LiptonReduction]: Checked pairs total: 3912 [2023-11-06 22:27:39,326 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-11-06 22:27:39,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:27:39,367 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;@7aee542b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:27:39,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-06 22:27:39,370 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:27:39,374 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:27:39,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:39,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:39,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:27:39,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:39,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash 501, now seen corresponding path program 1 times [2023-11-06 22:27:39,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992795277] [2023-11-06 22:27:39,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:39,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:39,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:39,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:39,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:27:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:39,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:27:39,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:39,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:39,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992795277] [2023-11-06 22:27:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992795277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:39,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:39,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:27:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326279384] [2023-11-06 22:27:39,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:39,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:27:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:39,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:27:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:27:39,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2023-11-06 22:27:39,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:39,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:39,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2023-11-06 22:27:39,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:39,818 INFO L124 PetriNetUnfolderBase]: 235/411 cut-off events. [2023-11-06 22:27:39,818 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:27:39,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 411 events. 235/411 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1772 event pairs, 235 based on Foata normal form. 20/326 useless extension candidates. Maximal degree in co-relation 819. Up to 405 conditions per place. [2023-11-06 22:27:39,831 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-11-06 22:27:39,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 84 flow [2023-11-06 22:27:39,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:27:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:27:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 215 transitions. [2023-11-06 22:27:39,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908675799086758 [2023-11-06 22:27:39,859 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 215 transitions. [2023-11-06 22:27:39,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 215 transitions. [2023-11-06 22:27:39,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:39,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 215 transitions. [2023-11-06 22:27:39,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:39,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:39,895 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:39,897 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 215 transitions. [2023-11-06 22:27:39,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 84 flow [2023-11-06 22:27:39,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:39,904 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-11-06 22:27:39,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-11-06 22:27:39,911 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-11-06 22:27:39,912 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-11-06 22:27:39,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:39,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:39,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:27:39,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:40,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:40,127 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:40,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 474806169, now seen corresponding path program 1 times [2023-11-06 22:27:40,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:40,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597153676] [2023-11-06 22:27:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:40,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:40,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:40,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:40,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:27:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:40,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:27:40,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:40,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:40,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:40,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597153676] [2023-11-06 22:27:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597153676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:40,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:27:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910132949] [2023-11-06 22:27:40,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:40,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:27:40,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:27:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:27:40,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 219 [2023-11-06 22:27:40,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:40,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:40,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 219 [2023-11-06 22:27:40,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:40,523 INFO L124 PetriNetUnfolderBase]: 183/385 cut-off events. [2023-11-06 22:27:40,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:40,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 385 events. 183/385 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1883 event pairs, 27 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 715. Up to 253 conditions per place. [2023-11-06 22:27:40,529 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 21 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2023-11-06 22:27:40,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 118 flow [2023-11-06 22:27:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:27:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:27:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-06 22:27:40,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4764079147640791 [2023-11-06 22:27:40,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-06 22:27:40,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-06 22:27:40,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:40,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-06 22:27:40,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:40,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:40,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:40,542 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 313 transitions. [2023-11-06 22:27:40,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 118 flow [2023-11-06 22:27:40,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:27:40,544 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-11-06 22:27:40,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-11-06 22:27:40,546 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-11-06 22:27:40,546 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-11-06 22:27:40,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:40,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:40,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:40,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:40,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:40,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:40,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1626181023, now seen corresponding path program 1 times [2023-11-06 22:27:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:40,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442443562] [2023-11-06 22:27:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:40,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:40,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:40,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:40,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:27:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:40,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:27:40,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:40,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:40,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442443562] [2023-11-06 22:27:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442443562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:40,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:40,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:27:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021073076] [2023-11-06 22:27:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:40,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:27:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:27:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:27:40,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-11-06 22:27:40,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:40,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:40,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-11-06 22:27:40,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:41,109 INFO L124 PetriNetUnfolderBase]: 45/112 cut-off events. [2023-11-06 22:27:41,109 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-06 22:27:41,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 112 events. 45/112 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 362 event pairs, 13 based on Foata normal form. 9/112 useless extension candidates. Maximal degree in co-relation 237. Up to 82 conditions per place. [2023-11-06 22:27:41,111 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 20 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-11-06 22:27:41,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 110 flow [2023-11-06 22:27:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:27:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:27:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-11-06 22:27:41,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4611872146118721 [2023-11-06 22:27:41,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-11-06 22:27:41,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-11-06 22:27:41,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:41,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-11-06 22:27:41,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,122 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 3 states and 303 transitions. [2023-11-06 22:27:41,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 110 flow [2023-11-06 22:27:41,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:41,124 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 59 flow [2023-11-06 22:27:41,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2023-11-06 22:27:41,126 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-11-06 22:27:41,126 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 59 flow [2023-11-06 22:27:41,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:41,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:41,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:41,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:41,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:41,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash 418467295, now seen corresponding path program 1 times [2023-11-06 22:27:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502712297] [2023-11-06 22:27:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:41,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:41,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:41,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:27:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:41,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:27:41,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:41,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:41,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:41,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502712297] [2023-11-06 22:27:41,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502712297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:41,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:27:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549947491] [2023-11-06 22:27:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:41,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:41,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-11-06 22:27:41,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:41,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-11-06 22:27:41,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:41,727 INFO L124 PetriNetUnfolderBase]: 15/52 cut-off events. [2023-11-06 22:27:41,728 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:27:41,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 52 events. 15/52 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 105 event pairs, 8 based on Foata normal form. 6/56 useless extension candidates. Maximal degree in co-relation 127. Up to 24 conditions per place. [2023-11-06 22:27:41,729 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 18 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-11-06 22:27:41,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 119 flow [2023-11-06 22:27:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:27:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-11-06 22:27:41,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2023-11-06 22:27:41,734 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-11-06 22:27:41,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-11-06 22:27:41,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:41,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-11-06 22:27:41,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,745 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,746 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 59 flow. Second operand 4 states and 396 transitions. [2023-11-06 22:27:41,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 119 flow [2023-11-06 22:27:41,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:27:41,749 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 72 flow [2023-11-06 22:27:41,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-06 22:27:41,752 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-06 22:27:41,759 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 72 flow [2023-11-06 22:27:41,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:41,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:41,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:41,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:41,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:41,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:41,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1281305030, now seen corresponding path program 1 times [2023-11-06 22:27:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:41,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155267427] [2023-11-06 22:27:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:41,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:41,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:41,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:41,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:27:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:42,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:27:42,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:42,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:42,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:42,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155267427] [2023-11-06 22:27:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155267427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:27:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707015117] [2023-11-06 22:27:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:42,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:42,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:42,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:42,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 219 [2023-11-06 22:27:42,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:42,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:42,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 219 [2023-11-06 22:27:42,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:42,694 INFO L124 PetriNetUnfolderBase]: 15/51 cut-off events. [2023-11-06 22:27:42,695 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-06 22:27:42,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 51 events. 15/51 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 7 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 131. Up to 39 conditions per place. [2023-11-06 22:27:42,696 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 17 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-11-06 22:27:42,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 119 flow [2023-11-06 22:27:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:27:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 350 transitions. [2023-11-06 22:27:42,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3995433789954338 [2023-11-06 22:27:42,700 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 350 transitions. [2023-11-06 22:27:42,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 350 transitions. [2023-11-06 22:27:42,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:42,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 350 transitions. [2023-11-06 22:27:42,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:42,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:42,707 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:42,707 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 72 flow. Second operand 4 states and 350 transitions. [2023-11-06 22:27:42,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 119 flow [2023-11-06 22:27:42,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 108 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:42,710 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 64 flow [2023-11-06 22:27:42,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2023-11-06 22:27:42,712 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-06 22:27:42,712 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 64 flow [2023-11-06 22:27:42,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:42,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:42,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:42,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:42,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:42,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:42,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 407660648, now seen corresponding path program 1 times [2023-11-06 22:27:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638079245] [2023-11-06 22:27:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:42,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:42,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:42,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:42,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:27:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:27:43,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:43,580 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:43,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638079245] [2023-11-06 22:27:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638079245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:43,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:27:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273239425] [2023-11-06 22:27:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:43,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:27:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:43,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:27:43,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:27:43,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 219 [2023-11-06 22:27:43,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:43,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:43,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 219 [2023-11-06 22:27:43,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:43,814 INFO L124 PetriNetUnfolderBase]: 21/74 cut-off events. [2023-11-06 22:27:43,816 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-06 22:27:43,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 74 events. 21/74 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 207 event pairs, 0 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 190. Up to 40 conditions per place. [2023-11-06 22:27:43,819 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 18 selfloop transitions, 1 changer transitions 13/34 dead transitions. [2023-11-06 22:27:43,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 182 flow [2023-11-06 22:27:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:27:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:27:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-11-06 22:27:43,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4374429223744292 [2023-11-06 22:27:43,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-11-06 22:27:43,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-11-06 22:27:43,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:43,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-11-06 22:27:43,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:43,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:43,834 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:43,834 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 64 flow. Second operand 5 states and 479 transitions. [2023-11-06 22:27:43,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 182 flow [2023-11-06 22:27:43,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:43,837 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 70 flow [2023-11-06 22:27:43,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2023-11-06 22:27:43,841 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-06 22:27:43,844 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 70 flow [2023-11-06 22:27:43,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:43,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:43,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:43,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:44,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:44,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:44,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash 157152502, now seen corresponding path program 2 times [2023-11-06 22:27:44,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:44,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27720844] [2023-11-06 22:27:44,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:27:44,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:44,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:44,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:44,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:27:44,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:27:44,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:27:44,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:27:44,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:44,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:44,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27720844] [2023-11-06 22:27:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27720844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:44,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:27:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354819757] [2023-11-06 22:27:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:44,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:27:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:44,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:27:44,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:27:44,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-11-06 22:27:44,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 70 flow. Second operand has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:44,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:44,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-11-06 22:27:44,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:45,259 INFO L124 PetriNetUnfolderBase]: 21/75 cut-off events. [2023-11-06 22:27:45,259 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-06 22:27:45,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 75 events. 21/75 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 2 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 207. Up to 20 conditions per place. [2023-11-06 22:27:45,260 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 15 selfloop transitions, 4 changer transitions 18/39 dead transitions. [2023-11-06 22:27:45,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 219 flow [2023-11-06 22:27:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:27:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:27:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 835 transitions. [2023-11-06 22:27:45,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42364282090309485 [2023-11-06 22:27:45,266 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 835 transitions. [2023-11-06 22:27:45,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 835 transitions. [2023-11-06 22:27:45,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:45,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 835 transitions. [2023-11-06 22:27:45,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.77777777777777) internal successors, (835), 9 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:45,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:45,276 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:45,276 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 70 flow. Second operand 9 states and 835 transitions. [2023-11-06 22:27:45,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 219 flow [2023-11-06 22:27:45,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 210 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:27:45,279 INFO L231 Difference]: Finished difference. Result has 40 places, 19 transitions, 77 flow [2023-11-06 22:27:45,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2023-11-06 22:27:45,280 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-11-06 22:27:45,280 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 19 transitions, 77 flow [2023-11-06 22:27:45,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:45,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:45,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:45,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:45,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 22:27:45,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash -687638950, now seen corresponding path program 3 times [2023-11-06 22:27:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837979515] [2023-11-06 22:27:45,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:27:45,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:45,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:45,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:27:45,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:27:45,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:27:45,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:27:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:27:45,839 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:27:45,840 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:27:45,841 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-06 22:27:45,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-06 22:27:45,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-06 22:27:45,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-06 22:27:45,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-06 22:27:45,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-06 22:27:45,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-06 22:27:45,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-06 22:27:45,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-06 22:27:45,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-06 22:27:45,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:46,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:46,068 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-06 22:27:46,074 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:27:46,075 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:27:46,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:27:46 BasicIcfg [2023-11-06 22:27:46,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:27:46,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:27:46,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:27:46,144 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:27:46,145 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:28" (3/4) ... [2023-11-06 22:27:46,147 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:27:46,148 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:27:46,149 INFO L158 Benchmark]: Toolchain (without parser) took 19680.81ms. Allocated memory was 92.3MB in the beginning and 136.3MB in the end (delta: 44.0MB). Free memory was 67.3MB in the beginning and 71.8MB in the end (delta: -4.5MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2023-11-06 22:27:46,149 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 39.1MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:27:46,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1040.70ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 67.5MB in the end (delta: -487.0kB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-11-06 22:27:46,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.10ms. Allocated memory is still 92.3MB. Free memory was 67.5MB in the beginning and 65.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:27:46,156 INFO L158 Benchmark]: Boogie Preprocessor took 102.87ms. Allocated memory is still 92.3MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:27:46,157 INFO L158 Benchmark]: RCFGBuilder took 1114.95ms. Allocated memory is still 92.3MB. Free memory was 62.9MB in the beginning and 53.2MB in the end (delta: 9.7MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2023-11-06 22:27:46,158 INFO L158 Benchmark]: TraceAbstraction took 17294.30ms. Allocated memory was 92.3MB in the beginning and 136.3MB in the end (delta: 44.0MB). Free memory was 52.5MB in the beginning and 72.8MB in the end (delta: -20.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-11-06 22:27:46,161 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 136.3MB. Free memory was 72.8MB in the beginning and 71.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:27:46,165 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.41ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 39.1MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1040.70ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 67.5MB in the end (delta: -487.0kB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.10ms. Allocated memory is still 92.3MB. Free memory was 67.5MB in the beginning and 65.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 102.87ms. Allocated memory is still 92.3MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1114.95ms. Allocated memory is still 92.3MB. Free memory was 62.9MB in the beginning and 53.2MB in the end (delta: 9.7MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17294.30ms. Allocated memory was 92.3MB in the beginning and 136.3MB in the end (delta: 44.0MB). Free memory was 52.5MB in the beginning and 72.8MB in the end (delta: -20.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 136.3MB. Free memory was 72.8MB in the beginning and 71.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.2s, 110 PlacesBefore, 32 PlacesAfterwards, 106 TransitionsBefore, 26 TransitionsAfterwards, 1592 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 3912 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2091, independent: 1956, independent conditional: 0, independent unconditional: 1956, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 913, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2091, independent: 1066, independent conditional: 0, independent unconditional: 1066, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 913, unknown conditional: 0, unknown unconditional: 913] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=-1, t1091={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=0, t1091={3:0}, t1092={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L746] 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) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 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 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 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, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 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) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 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 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 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) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={3:0}, t1092={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 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) [L823] 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)) [L824] 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)) [L825] 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)) [L826] 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)) [L827] 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] 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", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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 5 procedures, 127 locations, 10 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: 17.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 14 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 4 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:27:46,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5adab3bf-eeb4-4bbc-bc01-79b7ff17056a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample