./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_rmo.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_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:10:29,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:10:29,239 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:10:29,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:10:29,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:10:29,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:10:29,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:10:29,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:10:29,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:10:29,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:10:29,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:10:29,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:10:29,325 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:10:29,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:10:29,327 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:10:29,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:10:29,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:10:29,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:10:29,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:10:29,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:10:29,330 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:10:29,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:10:29,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:10:29,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:10:29,333 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:10:29,333 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:10:29,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:10:29,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:10:29,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:10:29,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:29,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:10:29,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:10:29,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:10:29,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:10:29,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:10:29,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:10:29,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:10:29,338 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:10:29,338 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_dfecab7b-0634-43d2-ae87-9ddb62279a45/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_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 -> 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 [2023-11-06 23:10:29,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:10:29,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:10:29,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:10:29,761 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:10:29,762 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:10:29,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2023-11-06 23:10:32,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:10:33,327 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:10:33,328 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2023-11-06 23:10:33,347 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/data/e8e9d884b/83ed26320c7f497e9456803ccd2ce89c/FLAGa28a0e9fa [2023-11-06 23:10:33,363 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/data/e8e9d884b/83ed26320c7f497e9456803ccd2ce89c [2023-11-06 23:10:33,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:10:33,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:10:33,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:33,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:10:33,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:10:33,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:33" (1/1) ... [2023-11-06 23:10:33,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1593f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:33, skipping insertion in model container [2023-11-06 23:10:33,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:33" (1/1) ... [2023-11-06 23:10:33,433 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:10:33,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:33,937 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:10:34,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:34,054 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:10:34,054 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:10:34,063 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:10:34,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34 WrapperNode [2023-11-06 23:10:34,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:34,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:34,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:10:34,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:10:34,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,131 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-11-06 23:10:34,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:34,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:10:34,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:10:34,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:10:34,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:10:34,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:10:34,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:10:34,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:10:34,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (1/1) ... [2023-11-06 23:10:34,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:34,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:34,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:10:34,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:10:34,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:10:34,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:10:34,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:10:34,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:10:34,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:10:34,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:10:34,263 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:10:34,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:10:34,263 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:10:34,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:10:34,264 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:10:34,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:10:34,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:10:34,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:10:34,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:10:34,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:10:34,268 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 23:10:34,442 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:10:34,444 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:10:35,079 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:10:35,707 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:10:35,708 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:10:35,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:35 BoogieIcfgContainer [2023-11-06 23:10:35,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:10:35,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:10:35,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:10:35,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:10:35,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:10:33" (1/3) ... [2023-11-06 23:10:35,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f59e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:35, skipping insertion in model container [2023-11-06 23:10:35,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:34" (2/3) ... [2023-11-06 23:10:35,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f59e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:35, skipping insertion in model container [2023-11-06 23:10:35,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:35" (3/3) ... [2023-11-06 23:10:35,725 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2023-11-06 23:10:35,747 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:10:35,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-06 23:10:35,748 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:10:35,888 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:10:35,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 178 transitions, 368 flow [2023-11-06 23:10:36,068 INFO L124 PetriNetUnfolderBase]: 3/175 cut-off events. [2023-11-06 23:10:36,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:10:36,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 3/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 262 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2023-11-06 23:10:36,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 178 transitions, 368 flow [2023-11-06 23:10:36,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 175 transitions, 359 flow [2023-11-06 23:10:36,090 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:10:36,102 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 175 transitions, 359 flow [2023-11-06 23:10:36,105 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 175 transitions, 359 flow [2023-11-06 23:10:36,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 175 transitions, 359 flow [2023-11-06 23:10:36,155 INFO L124 PetriNetUnfolderBase]: 3/175 cut-off events. [2023-11-06 23:10:36,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:10:36,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 3/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 259 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2023-11-06 23:10:36,163 INFO L119 LiptonReduction]: Number of co-enabled transitions 7168 [2023-11-06 23:10:49,437 INFO L134 LiptonReduction]: Checked pairs total: 35920 [2023-11-06 23:10:49,438 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-11-06 23:10:49,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:10:49,472 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;@577eb174, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:10:49,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-11-06 23:10:49,475 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:10:49,475 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:10:49,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:10:49,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:49,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:10:49,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:10:49,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash 978, now seen corresponding path program 1 times [2023-11-06 23:10:49,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162082255] [2023-11-06 23:10:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:49,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:49,665 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 23:10:49,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162082255] [2023-11-06 23:10:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162082255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:49,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:49,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:10:49,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633433062] [2023-11-06 23:10:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:49,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:10:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:10:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:10:49,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 332 [2023-11-06 23:10:49,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 149 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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 23:10:49,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:49,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 332 [2023-11-06 23:10:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:52,881 INFO L124 PetriNetUnfolderBase]: 11256/15868 cut-off events. [2023-11-06 23:10:52,882 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-06 23:10:52,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31802 conditions, 15868 events. 11256/15868 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 99863 event pairs, 11256 based on Foata normal form. 0/7392 useless extension candidates. Maximal degree in co-relation 31791. Up to 15858 conditions per place. [2023-11-06 23:10:53,035 INFO L140 encePairwiseOnDemand]: 305/332 looper letters, 39 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-11-06 23:10:53,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 171 flow [2023-11-06 23:10:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:10:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:10:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 330 transitions. [2023-11-06 23:10:53,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49698795180722893 [2023-11-06 23:10:53,053 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 330 transitions. [2023-11-06 23:10:53,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 330 transitions. [2023-11-06 23:10:53,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:53,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 330 transitions. [2023-11-06 23:10:53,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 165.0) internal successors, (330), 2 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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 23:10:53,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states 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 23:10:53,069 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states 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 23:10:53,071 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 149 flow. Second operand 2 states and 330 transitions. [2023-11-06 23:10:53,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 171 flow [2023-11-06 23:10:53,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:10:53,081 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-11-06 23:10:53,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-11-06 23:10:53,087 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2023-11-06 23:10:53,087 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-11-06 23:10:53,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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 23:10:53,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:53,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 23:10:53,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:10:53,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:10:53,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash 964357, now seen corresponding path program 1 times [2023-11-06 23:10:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:53,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804747949] [2023-11-06 23:10:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:53,377 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 23:10:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804747949] [2023-11-06 23:10:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804747949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:53,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:53,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:10:53,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098893751] [2023-11-06 23:10:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:53,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:53,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:53,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 332 [2023-11-06 23:10:53,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 23:10:53,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:53,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 332 [2023-11-06 23:10:53,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:55,544 INFO L124 PetriNetUnfolderBase]: 7437/11015 cut-off events. [2023-11-06 23:10:55,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:10:55,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21994 conditions, 11015 events. 7437/11015 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 70936 event pairs, 4665 based on Foata normal form. 0/6422 useless extension candidates. Maximal degree in co-relation 21991. Up to 6806 conditions per place. [2023-11-06 23:10:55,626 INFO L140 encePairwiseOnDemand]: 316/332 looper letters, 44 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2023-11-06 23:10:55,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 224 flow [2023-11-06 23:10:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-06 23:10:55,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4397590361445783 [2023-11-06 23:10:55,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-06 23:10:55,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-06 23:10:55,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:55,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-06 23:10:55,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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 23:10:55,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:10:55,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:10:55,649 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 438 transitions. [2023-11-06 23:10:55,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 224 flow [2023-11-06 23:10:55,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:10:55,653 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 160 flow [2023-11-06 23:10:55,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-11-06 23:10:55,655 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2023-11-06 23:10:55,656 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 160 flow [2023-11-06 23:10:55,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 23:10:55,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:55,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 23:10:55,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:10:55,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:10:55,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash 964358, now seen corresponding path program 1 times [2023-11-06 23:10:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208121299] [2023-11-06 23:10:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:55,800 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 23:10:55,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:55,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208121299] [2023-11-06 23:10:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208121299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:55,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:10:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540707932] [2023-11-06 23:10:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:55,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:55,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:55,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:55,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 332 [2023-11-06 23:10:55,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 23:10:55,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:55,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 332 [2023-11-06 23:10:55,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:56,798 INFO L124 PetriNetUnfolderBase]: 2596/4054 cut-off events. [2023-11-06 23:10:56,799 INFO L125 PetriNetUnfolderBase]: For 1135/1135 co-relation queries the response was YES. [2023-11-06 23:10:56,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11315 conditions, 4054 events. 2596/4054 cut-off events. For 1135/1135 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 23876 event pairs, 1940 based on Foata normal form. 1104/4674 useless extension candidates. Maximal degree in co-relation 11310. Up to 3999 conditions per place. [2023-11-06 23:10:56,837 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 36 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-11-06 23:10:56,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 220 flow [2023-11-06 23:10:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-11-06 23:10:56,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428714859437751 [2023-11-06 23:10:56,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-11-06 23:10:56,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-11-06 23:10:56,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:56,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-11-06 23:10:56,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:56,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:10:56,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:10:56,849 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 160 flow. Second operand 3 states and 427 transitions. [2023-11-06 23:10:56,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 220 flow [2023-11-06 23:10:56,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:10:56,866 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 130 flow [2023-11-06 23:10:56,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-11-06 23:10:56,868 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -34 predicate places. [2023-11-06 23:10:56,868 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 130 flow [2023-11-06 23:10:56,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 23:10:56,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:56,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:56,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:10:56,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:10:56,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1499248999, now seen corresponding path program 1 times [2023-11-06 23:10:56,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:56,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184500913] [2023-11-06 23:10:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:57,334 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 23:10:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184500913] [2023-11-06 23:10:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184500913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:57,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:10:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576710508] [2023-11-06 23:10:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:57,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:57,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:57,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 332 [2023-11-06 23:10:57,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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 23:10:57,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:57,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 332 [2023-11-06 23:10:57,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:58,556 INFO L124 PetriNetUnfolderBase]: 3160/4876 cut-off events. [2023-11-06 23:10:58,556 INFO L125 PetriNetUnfolderBase]: For 681/681 co-relation queries the response was YES. [2023-11-06 23:10:58,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12541 conditions, 4876 events. 3160/4876 cut-off events. For 681/681 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 29235 event pairs, 982 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 12536. Up to 3354 conditions per place. [2023-11-06 23:10:58,584 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 63 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-06 23:10:58,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 350 flow [2023-11-06 23:10:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-11-06 23:10:58,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44477911646586343 [2023-11-06 23:10:58,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-11-06 23:10:58,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-11-06 23:10:58,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:58,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-11-06 23:10:58,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 23:10:58,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:10:58,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:10:58,594 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 130 flow. Second operand 3 states and 443 transitions. [2023-11-06 23:10:58,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 350 flow [2023-11-06 23:10:58,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:10:58,597 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 137 flow [2023-11-06 23:10:58,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-11-06 23:10:58,598 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -32 predicate places. [2023-11-06 23:10:58,599 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 137 flow [2023-11-06 23:10:58,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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 23:10:58,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:58,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:58,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:10:58,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:10:58,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1499248655, now seen corresponding path program 1 times [2023-11-06 23:10:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26987831] [2023-11-06 23:10:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:58,731 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 23:10:58,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26987831] [2023-11-06 23:10:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26987831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:58,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:58,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:10:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979412992] [2023-11-06 23:10:58,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:58,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:58,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:58,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 332 [2023-11-06 23:10:58,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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 23:10:58,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:58,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 332 [2023-11-06 23:10:58,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:59,322 INFO L124 PetriNetUnfolderBase]: 2487/4078 cut-off events. [2023-11-06 23:10:59,322 INFO L125 PetriNetUnfolderBase]: For 506/509 co-relation queries the response was YES. [2023-11-06 23:10:59,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10352 conditions, 4078 events. 2487/4078 cut-off events. For 506/509 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 26117 event pairs, 903 based on Foata normal form. 0/3265 useless extension candidates. Maximal degree in co-relation 10346. Up to 2481 conditions per place. [2023-11-06 23:10:59,353 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 63 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2023-11-06 23:10:59,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 367 flow [2023-11-06 23:10:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-06 23:10:59,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497991967871486 [2023-11-06 23:10:59,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-06 23:10:59,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-06 23:10:59,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:59,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-06 23:10:59,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:59,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:10:59,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:10:59,364 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 137 flow. Second operand 3 states and 448 transitions. [2023-11-06 23:10:59,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 367 flow [2023-11-06 23:10:59,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:10:59,368 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 146 flow [2023-11-06 23:10:59,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-06 23:10:59,369 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -31 predicate places. [2023-11-06 23:10:59,369 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 146 flow [2023-11-06 23:10:59,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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 23:10:59,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:59,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:59,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:10:59,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:10:59,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash -767923366, now seen corresponding path program 1 times [2023-11-06 23:10:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:59,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137311635] [2023-11-06 23:10:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:59,473 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 23:10:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:59,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137311635] [2023-11-06 23:10:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137311635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:10:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269527524] [2023-11-06 23:10:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:59,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:59,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:59,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 332 [2023-11-06 23:10:59,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 23:10:59,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:59,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 332 [2023-11-06 23:10:59,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:00,289 INFO L124 PetriNetUnfolderBase]: 2669/4412 cut-off events. [2023-11-06 23:11:00,289 INFO L125 PetriNetUnfolderBase]: For 984/987 co-relation queries the response was YES. [2023-11-06 23:11:00,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11890 conditions, 4412 events. 2669/4412 cut-off events. For 984/987 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 29221 event pairs, 971 based on Foata normal form. 0/3757 useless extension candidates. Maximal degree in co-relation 11883. Up to 2853 conditions per place. [2023-11-06 23:11:00,319 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 50 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-11-06 23:11:00,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 314 flow [2023-11-06 23:11:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:11:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:11:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-06 23:11:00,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357429718875502 [2023-11-06 23:11:00,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-06 23:11:00,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-06 23:11:00,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:00,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-06 23:11:00,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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 23:11:00,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:11:00,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:11:00,329 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 146 flow. Second operand 3 states and 434 transitions. [2023-11-06 23:11:00,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 314 flow [2023-11-06 23:11:00,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:00,332 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 178 flow [2023-11-06 23:11:00,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-11-06 23:11:00,334 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -31 predicate places. [2023-11-06 23:11:00,334 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 178 flow [2023-11-06 23:11:00,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 23:11:00,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:00,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:00,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:11:00,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:00,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash -767923365, now seen corresponding path program 1 times [2023-11-06 23:11:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:00,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663330203] [2023-11-06 23:11:00,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:00,517 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 23:11:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:00,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663330203] [2023-11-06 23:11:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663330203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:00,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:11:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282342478] [2023-11-06 23:11:00,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:00,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:11:00,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:00,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:11:00,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:11:00,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 332 [2023-11-06 23:11:00,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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 23:11:00,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:00,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 332 [2023-11-06 23:11:00,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:01,281 INFO L124 PetriNetUnfolderBase]: 2605/4230 cut-off events. [2023-11-06 23:11:01,282 INFO L125 PetriNetUnfolderBase]: For 2126/2126 co-relation queries the response was YES. [2023-11-06 23:11:01,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12334 conditions, 4230 events. 2605/4230 cut-off events. For 2126/2126 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 27091 event pairs, 1489 based on Foata normal form. 32/3605 useless extension candidates. Maximal degree in co-relation 12326. Up to 2718 conditions per place. [2023-11-06 23:11:01,307 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 64 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-11-06 23:11:01,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 408 flow [2023-11-06 23:11:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:11:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:11:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2023-11-06 23:11:01,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307228915662651 [2023-11-06 23:11:01,311 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 572 transitions. [2023-11-06 23:11:01,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 572 transitions. [2023-11-06 23:11:01,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:01,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 572 transitions. [2023-11-06 23:11:01,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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 23:11:01,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states 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 23:11:01,321 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states 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 23:11:01,321 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 178 flow. Second operand 4 states and 572 transitions. [2023-11-06 23:11:01,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 408 flow [2023-11-06 23:11:01,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:01,377 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 171 flow [2023-11-06 23:11:01,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=4, PETRI_FLOW=171, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-11-06 23:11:01,378 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -31 predicate places. [2023-11-06 23:11:01,379 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 171 flow [2023-11-06 23:11:01,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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 23:11:01,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:01,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:01,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:11:01,380 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:01,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash -655815471, now seen corresponding path program 1 times [2023-11-06 23:11:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:01,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854328240] [2023-11-06 23:11:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:01,760 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 23:11:01,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:01,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854328240] [2023-11-06 23:11:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854328240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:11:01,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814133677] [2023-11-06 23:11:01,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:01,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:11:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:11:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:11:01,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 332 [2023-11-06 23:11:01,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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 23:11:01,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:01,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 332 [2023-11-06 23:11:01,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:02,479 INFO L124 PetriNetUnfolderBase]: 2576/4263 cut-off events. [2023-11-06 23:11:02,479 INFO L125 PetriNetUnfolderBase]: For 2040/2043 co-relation queries the response was YES. [2023-11-06 23:11:02,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12024 conditions, 4263 events. 2576/4263 cut-off events. For 2040/2043 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 28076 event pairs, 958 based on Foata normal form. 12/3620 useless extension candidates. Maximal degree in co-relation 12017. Up to 2707 conditions per place. [2023-11-06 23:11:02,509 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 63 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2023-11-06 23:11:02,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 399 flow [2023-11-06 23:11:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:11:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:11:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 23:11:02,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4367469879518072 [2023-11-06 23:11:02,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 23:11:02,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 23:11:02,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:02,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 23:11:02,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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 23:11:02,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:11:02,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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 23:11:02,519 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 171 flow. Second operand 3 states and 435 transitions. [2023-11-06 23:11:02,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 399 flow [2023-11-06 23:11:02,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:02,531 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 178 flow [2023-11-06 23:11:02,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=3, PETRI_FLOW=178, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-06 23:11:02,532 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -30 predicate places. [2023-11-06 23:11:02,532 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 178 flow [2023-11-06 23:11:02,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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 23:11:02,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:02,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:02,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:11:02,533 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:02,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1964254938, now seen corresponding path program 1 times [2023-11-06 23:11:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:02,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028136910] [2023-11-06 23:11:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:02,717 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 23:11:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:02,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028136910] [2023-11-06 23:11:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028136910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:11:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518896550] [2023-11-06 23:11:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:02,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:11:02,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:11:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:11:02,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 332 [2023-11-06 23:11:02,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 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 23:11:02,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:02,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 332 [2023-11-06 23:11:02,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:03,397 INFO L124 PetriNetUnfolderBase]: 2242/3652 cut-off events. [2023-11-06 23:11:03,397 INFO L125 PetriNetUnfolderBase]: For 1828/1828 co-relation queries the response was YES. [2023-11-06 23:11:03,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10960 conditions, 3652 events. 2242/3652 cut-off events. For 1828/1828 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 22347 event pairs, 871 based on Foata normal form. 16/3098 useless extension candidates. Maximal degree in co-relation 10952. Up to 1429 conditions per place. [2023-11-06 23:11:03,413 INFO L140 encePairwiseOnDemand]: 319/332 looper letters, 43 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2023-11-06 23:11:03,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 348 flow [2023-11-06 23:11:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:11:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:11:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-11-06 23:11:03,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40286144578313254 [2023-11-06 23:11:03,416 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-11-06 23:11:03,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-11-06 23:11:03,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:03,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-11-06 23:11:03,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 23:11:03,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states 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 23:11:03,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states 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 23:11:03,422 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 178 flow. Second operand 4 states and 535 transitions. [2023-11-06 23:11:03,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 348 flow [2023-11-06 23:11:03,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:03,430 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 250 flow [2023-11-06 23:11:03,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-11-06 23:11:03,431 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2023-11-06 23:11:03,431 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 250 flow [2023-11-06 23:11:03,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 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 23:11:03,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:03,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:03,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:11:03,432 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:03,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash -311763766, now seen corresponding path program 1 times [2023-11-06 23:11:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:03,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588990801] [2023-11-06 23:11:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:05,103 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 23:11:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588990801] [2023-11-06 23:11:05,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588990801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:05,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:11:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187874097] [2023-11-06 23:11:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:05,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:11:05,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:05,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:11:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:11:05,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 332 [2023-11-06 23:11:05,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 250 flow. Second operand has 9 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states 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 23:11:05,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:05,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 332 [2023-11-06 23:11:05,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:06,831 INFO L124 PetriNetUnfolderBase]: 2548/4120 cut-off events. [2023-11-06 23:11:06,832 INFO L125 PetriNetUnfolderBase]: For 2864/2867 co-relation queries the response was YES. [2023-11-06 23:11:06,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13760 conditions, 4120 events. 2548/4120 cut-off events. For 2864/2867 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 25873 event pairs, 525 based on Foata normal form. 6/3727 useless extension candidates. Maximal degree in co-relation 13751. Up to 3570 conditions per place. [2023-11-06 23:11:06,858 INFO L140 encePairwiseOnDemand]: 321/332 looper letters, 78 selfloop transitions, 26 changer transitions 0/106 dead transitions. [2023-11-06 23:11:06,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 708 flow [2023-11-06 23:11:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:11:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 23:11:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1338 transitions. [2023-11-06 23:11:06,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663745892661555 [2023-11-06 23:11:06,866 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1338 transitions. [2023-11-06 23:11:06,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1338 transitions. [2023-11-06 23:11:06,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:06,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1338 transitions. [2023-11-06 23:11:06,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.63636363636364) internal successors, (1338), 11 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states 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 23:11:06,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 332.0) internal successors, (3984), 12 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states 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 23:11:06,883 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 332.0) internal successors, (3984), 12 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states 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 23:11:06,883 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 250 flow. Second operand 11 states and 1338 transitions. [2023-11-06 23:11:06,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 708 flow [2023-11-06 23:11:06,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:11:06,901 INFO L231 Difference]: Finished difference. Result has 65 places, 70 transitions, 478 flow [2023-11-06 23:11:06,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=478, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2023-11-06 23:11:06,902 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -14 predicate places. [2023-11-06 23:11:06,903 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 478 flow [2023-11-06 23:11:06,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states 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 23:11:06,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:06,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:06,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:11:06,904 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:06,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1616600946, now seen corresponding path program 2 times [2023-11-06 23:11:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:06,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382630181] [2023-11-06 23:11:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:08,431 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 23:11:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382630181] [2023-11-06 23:11:08,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382630181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:08,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:08,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:11:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45450407] [2023-11-06 23:11:08,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:08,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:08,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:08,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:08,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:11:08,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 332 [2023-11-06 23:11:08,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 478 flow. Second operand has 8 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 states 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 23:11:08,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:08,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 332 [2023-11-06 23:11:08,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:09,776 INFO L124 PetriNetUnfolderBase]: 2535/4119 cut-off events. [2023-11-06 23:11:09,776 INFO L125 PetriNetUnfolderBase]: For 3880/3883 co-relation queries the response was YES. [2023-11-06 23:11:09,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15076 conditions, 4119 events. 2535/4119 cut-off events. For 3880/3883 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 25861 event pairs, 360 based on Foata normal form. 6/3727 useless extension candidates. Maximal degree in co-relation 15062. Up to 3078 conditions per place. [2023-11-06 23:11:09,802 INFO L140 encePairwiseOnDemand]: 322/332 looper letters, 94 selfloop transitions, 49 changer transitions 0/145 dead transitions. [2023-11-06 23:11:09,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 145 transitions, 1181 flow [2023-11-06 23:11:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:11:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 23:11:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1346 transitions. [2023-11-06 23:11:09,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36856516976998904 [2023-11-06 23:11:09,809 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1346 transitions. [2023-11-06 23:11:09,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1346 transitions. [2023-11-06 23:11:09,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:09,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1346 transitions. [2023-11-06 23:11:09,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.36363636363636) internal successors, (1346), 11 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states 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 23:11:09,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 332.0) internal successors, (3984), 12 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states 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 23:11:09,825 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 332.0) internal successors, (3984), 12 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states 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 23:11:09,826 INFO L175 Difference]: Start difference. First operand has 65 places, 70 transitions, 478 flow. Second operand 11 states and 1346 transitions. [2023-11-06 23:11:09,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 145 transitions, 1181 flow [2023-11-06 23:11:09,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 145 transitions, 1179 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 23:11:09,874 INFO L231 Difference]: Finished difference. Result has 80 places, 96 transitions, 888 flow [2023-11-06 23:11:09,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=888, PETRI_PLACES=80, PETRI_TRANSITIONS=96} [2023-11-06 23:11:09,876 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2023-11-06 23:11:09,876 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 888 flow [2023-11-06 23:11:09,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 states 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 23:11:09,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:09,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:09,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:11:09,877 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:09,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2136617522, now seen corresponding path program 1 times [2023-11-06 23:11:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575269131] [2023-11-06 23:11:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:10,555 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 23:11:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575269131] [2023-11-06 23:11:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575269131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:10,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:11:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217697610] [2023-11-06 23:11:10,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:10,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:11:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:10,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:11:10,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:11:11,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 332 [2023-11-06 23:11:11,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 888 flow. Second operand has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states 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 23:11:11,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:11,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 332 [2023-11-06 23:11:11,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:12,310 INFO L124 PetriNetUnfolderBase]: 2586/4188 cut-off events. [2023-11-06 23:11:12,310 INFO L125 PetriNetUnfolderBase]: For 7501/7501 co-relation queries the response was YES. [2023-11-06 23:11:12,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16339 conditions, 4188 events. 2586/4188 cut-off events. For 7501/7501 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 26510 event pairs, 1027 based on Foata normal form. 0/4001 useless extension candidates. Maximal degree in co-relation 16319. Up to 2378 conditions per place. [2023-11-06 23:11:12,348 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 126 selfloop transitions, 29 changer transitions 0/157 dead transitions. [2023-11-06 23:11:12,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 157 transitions, 1466 flow [2023-11-06 23:11:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:11:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:11:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1122 transitions. [2023-11-06 23:11:12,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3755020080321285 [2023-11-06 23:11:12,354 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1122 transitions. [2023-11-06 23:11:12,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1122 transitions. [2023-11-06 23:11:12,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:12,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1122 transitions. [2023-11-06 23:11:12,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.66666666666667) internal successors, (1122), 9 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states 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 23:11:12,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 332.0) internal successors, (3320), 10 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states 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 23:11:12,369 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 332.0) internal successors, (3320), 10 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states 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 23:11:12,369 INFO L175 Difference]: Start difference. First operand has 80 places, 96 transitions, 888 flow. Second operand 9 states and 1122 transitions. [2023-11-06 23:11:12,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 157 transitions, 1466 flow [2023-11-06 23:11:12,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 157 transitions, 1436 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-06 23:11:12,475 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 999 flow [2023-11-06 23:11:12,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=999, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2023-11-06 23:11:12,476 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 10 predicate places. [2023-11-06 23:11:12,476 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 999 flow [2023-11-06 23:11:12,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states 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 23:11:12,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:12,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:12,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:11:12,477 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:12,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash 762360833, now seen corresponding path program 1 times [2023-11-06 23:11:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:12,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141924535] [2023-11-06 23:11:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:12,933 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 23:11:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:12,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141924535] [2023-11-06 23:11:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141924535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:12,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:12,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:11:12,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723002932] [2023-11-06 23:11:12,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:12,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:11:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:11:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:11:13,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 332 [2023-11-06 23:11:13,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 999 flow. Second operand has 9 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 23:11:13,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:13,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 332 [2023-11-06 23:11:13,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:14,316 INFO L124 PetriNetUnfolderBase]: 2878/4586 cut-off events. [2023-11-06 23:11:14,316 INFO L125 PetriNetUnfolderBase]: For 10048/10048 co-relation queries the response was YES. [2023-11-06 23:11:14,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18274 conditions, 4586 events. 2878/4586 cut-off events. For 10048/10048 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 28801 event pairs, 1056 based on Foata normal form. 80/4433 useless extension candidates. Maximal degree in co-relation 18250. Up to 1370 conditions per place. [2023-11-06 23:11:14,358 INFO L140 encePairwiseOnDemand]: 317/332 looper letters, 103 selfloop transitions, 60 changer transitions 0/166 dead transitions. [2023-11-06 23:11:14,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 166 transitions, 1775 flow [2023-11-06 23:11:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:11:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:11:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 908 transitions. [2023-11-06 23:11:14,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39070567986230637 [2023-11-06 23:11:14,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 908 transitions. [2023-11-06 23:11:14,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 908 transitions. [2023-11-06 23:11:14,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:14,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 908 transitions. [2023-11-06 23:11:14,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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 23:11:14,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states 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 23:11:14,374 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states 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 23:11:14,375 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 999 flow. Second operand 7 states and 908 transitions. [2023-11-06 23:11:14,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 166 transitions, 1775 flow [2023-11-06 23:11:14,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 166 transitions, 1738 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-06 23:11:14,471 INFO L231 Difference]: Finished difference. Result has 94 places, 124 transitions, 1487 flow [2023-11-06 23:11:14,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1487, PETRI_PLACES=94, PETRI_TRANSITIONS=124} [2023-11-06 23:11:14,472 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2023-11-06 23:11:14,472 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 124 transitions, 1487 flow [2023-11-06 23:11:14,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 23:11:14,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:14,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:14,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:11:14,474 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:14,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:14,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1554105366, now seen corresponding path program 2 times [2023-11-06 23:11:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:14,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478216747] [2023-11-06 23:11:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:15,019 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 23:11:15,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:15,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478216747] [2023-11-06 23:11:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478216747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:15,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:15,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:11:15,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433010218] [2023-11-06 23:11:15,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:15,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:15,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:11:15,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 332 [2023-11-06 23:11:15,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 124 transitions, 1487 flow. Second operand has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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 23:11:15,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:15,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 332 [2023-11-06 23:11:15,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:16,572 INFO L124 PetriNetUnfolderBase]: 2577/4138 cut-off events. [2023-11-06 23:11:16,572 INFO L125 PetriNetUnfolderBase]: For 14273/14273 co-relation queries the response was YES. [2023-11-06 23:11:16,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17809 conditions, 4138 events. 2577/4138 cut-off events. For 14273/14273 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 25508 event pairs, 698 based on Foata normal form. 0/4108 useless extension candidates. Maximal degree in co-relation 17784. Up to 1567 conditions per place. [2023-11-06 23:11:16,606 INFO L140 encePairwiseOnDemand]: 325/332 looper letters, 103 selfloop transitions, 40 changer transitions 2/147 dead transitions. [2023-11-06 23:11:16,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 147 transitions, 1786 flow [2023-11-06 23:11:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:11:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:11:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2023-11-06 23:11:16,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3769363166953528 [2023-11-06 23:11:16,611 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2023-11-06 23:11:16,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2023-11-06 23:11:16,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:16,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2023-11-06 23:11:16,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 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 23:11:16,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states 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 23:11:16,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states 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 23:11:16,620 INFO L175 Difference]: Start difference. First operand has 94 places, 124 transitions, 1487 flow. Second operand 7 states and 876 transitions. [2023-11-06 23:11:16,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 147 transitions, 1786 flow [2023-11-06 23:11:16,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 147 transitions, 1760 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:16,732 INFO L231 Difference]: Finished difference. Result has 97 places, 112 transitions, 1370 flow [2023-11-06 23:11:16,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1370, PETRI_PLACES=97, PETRI_TRANSITIONS=112} [2023-11-06 23:11:16,732 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2023-11-06 23:11:16,733 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 1370 flow [2023-11-06 23:11:16,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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 23:11:16,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:16,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:16,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:11:16,734 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:16,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1091343423, now seen corresponding path program 1 times [2023-11-06 23:11:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640405335] [2023-11-06 23:11:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:16,923 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 23:11:16,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:16,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640405335] [2023-11-06 23:11:16,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640405335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:16,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:16,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:11:16,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814353276] [2023-11-06 23:11:16,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:16,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:11:16,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:16,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:11:16,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:11:16,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 332 [2023-11-06 23:11:16,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 1370 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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 23:11:16,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:16,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 332 [2023-11-06 23:11:16,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:17,573 INFO L124 PetriNetUnfolderBase]: 1481/2576 cut-off events. [2023-11-06 23:11:17,573 INFO L125 PetriNetUnfolderBase]: For 9312/9315 co-relation queries the response was YES. [2023-11-06 23:11:17,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11142 conditions, 2576 events. 1481/2576 cut-off events. For 9312/9315 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15847 event pairs, 299 based on Foata normal form. 112/2669 useless extension candidates. Maximal degree in co-relation 11116. Up to 2142 conditions per place. [2023-11-06 23:11:17,591 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 121 selfloop transitions, 4 changer transitions 24/152 dead transitions. [2023-11-06 23:11:17,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 152 transitions, 1933 flow [2023-11-06 23:11:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:11:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:11:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-11-06 23:11:17,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4150602409638554 [2023-11-06 23:11:17,595 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-11-06 23:11:17,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-11-06 23:11:17,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:17,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-11-06 23:11:17,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:17,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states 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 23:11:17,601 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states 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 23:11:17,602 INFO L175 Difference]: Start difference. First operand has 97 places, 112 transitions, 1370 flow. Second operand 5 states and 689 transitions. [2023-11-06 23:11:17,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 152 transitions, 1933 flow [2023-11-06 23:11:17,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 152 transitions, 1839 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-06 23:11:17,650 INFO L231 Difference]: Finished difference. Result has 98 places, 110 transitions, 1247 flow [2023-11-06 23:11:17,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1247, PETRI_PLACES=98, PETRI_TRANSITIONS=110} [2023-11-06 23:11:17,651 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2023-11-06 23:11:17,651 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 110 transitions, 1247 flow [2023-11-06 23:11:17,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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 23:11:17,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:17,652 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 23:11:17,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:11:17,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:17,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1391457757, now seen corresponding path program 1 times [2023-11-06 23:11:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866940393] [2023-11-06 23:11:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:17,835 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 23:11:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866940393] [2023-11-06 23:11:17,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866940393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:17,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:17,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:11:17,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167007036] [2023-11-06 23:11:17,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:17,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:11:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:11:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:11:17,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 332 [2023-11-06 23:11:17,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 110 transitions, 1247 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 23:11:17,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:17,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 332 [2023-11-06 23:11:17,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:19,215 INFO L124 PetriNetUnfolderBase]: 4070/6910 cut-off events. [2023-11-06 23:11:19,215 INFO L125 PetriNetUnfolderBase]: For 26343/26343 co-relation queries the response was YES. [2023-11-06 23:11:19,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32792 conditions, 6910 events. 4070/6910 cut-off events. For 26343/26343 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 46840 event pairs, 853 based on Foata normal form. 84/6953 useless extension candidates. Maximal degree in co-relation 32763. Up to 2959 conditions per place. [2023-11-06 23:11:19,282 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 261 selfloop transitions, 3 changer transitions 0/265 dead transitions. [2023-11-06 23:11:19,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 265 transitions, 3518 flow [2023-11-06 23:11:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:11:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:11:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-11-06 23:11:19,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2023-11-06 23:11:19,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-11-06 23:11:19,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-11-06 23:11:19,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:19,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-11-06 23:11:19,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 23:11:19,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states 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 23:11:19,293 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states 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 23:11:19,293 INFO L175 Difference]: Start difference. First operand has 98 places, 110 transitions, 1247 flow. Second operand 4 states and 581 transitions. [2023-11-06 23:11:19,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 265 transitions, 3518 flow [2023-11-06 23:11:19,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 265 transitions, 3502 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:19,518 INFO L231 Difference]: Finished difference. Result has 99 places, 112 transitions, 1264 flow [2023-11-06 23:11:19,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1264, PETRI_PLACES=99, PETRI_TRANSITIONS=112} [2023-11-06 23:11:19,518 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2023-11-06 23:11:19,519 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 112 transitions, 1264 flow [2023-11-06 23:11:19,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 23:11:19,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:19,519 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 23:11:19,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:11:19,519 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:19,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1085155689, now seen corresponding path program 2 times [2023-11-06 23:11:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:19,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416991496] [2023-11-06 23:11:19,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:19,700 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 23:11:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416991496] [2023-11-06 23:11:19,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416991496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:11:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263118926] [2023-11-06 23:11:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:19,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:11:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:19,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:11:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:11:19,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 332 [2023-11-06 23:11:19,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 112 transitions, 1264 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 23:11:19,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:19,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 332 [2023-11-06 23:11:19,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:20,515 INFO L124 PetriNetUnfolderBase]: 1155/2286 cut-off events. [2023-11-06 23:11:20,515 INFO L125 PetriNetUnfolderBase]: For 6062/6071 co-relation queries the response was YES. [2023-11-06 23:11:20,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10087 conditions, 2286 events. 1155/2286 cut-off events. For 6062/6071 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15320 event pairs, 148 based on Foata normal form. 184/2418 useless extension candidates. Maximal degree in co-relation 10057. Up to 1183 conditions per place. [2023-11-06 23:11:20,542 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 92 selfloop transitions, 7 changer transitions 37/140 dead transitions. [2023-11-06 23:11:20,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 140 transitions, 1587 flow [2023-11-06 23:11:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:11:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:11:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2023-11-06 23:11:20,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146586345381526 [2023-11-06 23:11:20,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 826 transitions. [2023-11-06 23:11:20,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 826 transitions. [2023-11-06 23:11:20,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:20,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 826 transitions. [2023-11-06 23:11:20,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.66666666666666) internal successors, (826), 6 states have internal predecessors, (826), 0 states have call successors, (0), 0 states 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 23:11:20,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 332.0) internal successors, (2324), 7 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states 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 23:11:20,555 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 332.0) internal successors, (2324), 7 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states 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 23:11:20,556 INFO L175 Difference]: Start difference. First operand has 99 places, 112 transitions, 1264 flow. Second operand 6 states and 826 transitions. [2023-11-06 23:11:20,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 140 transitions, 1587 flow [2023-11-06 23:11:20,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 140 transitions, 1514 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-11-06 23:11:20,596 INFO L231 Difference]: Finished difference. Result has 97 places, 74 transitions, 725 flow [2023-11-06 23:11:20,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=97, PETRI_TRANSITIONS=74} [2023-11-06 23:11:20,597 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2023-11-06 23:11:20,597 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 74 transitions, 725 flow [2023-11-06 23:11:20,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 23:11:20,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:20,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:20,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:11:20,598 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:20,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1002210184, now seen corresponding path program 1 times [2023-11-06 23:11:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935506024] [2023-11-06 23:11:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:20,892 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 23:11:20,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:20,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935506024] [2023-11-06 23:11:20,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935506024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:20,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:20,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:11:20,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100485805] [2023-11-06 23:11:20,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:20,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:11:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:20,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:11:20,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:11:20,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 332 [2023-11-06 23:11:20,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 74 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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 23:11:20,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:20,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 332 [2023-11-06 23:11:20,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:21,410 INFO L124 PetriNetUnfolderBase]: 549/1108 cut-off events. [2023-11-06 23:11:21,411 INFO L125 PetriNetUnfolderBase]: For 3371/3374 co-relation queries the response was YES. [2023-11-06 23:11:21,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 1108 events. 549/1108 cut-off events. For 3371/3374 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6748 event pairs, 85 based on Foata normal form. 67/1134 useless extension candidates. Maximal degree in co-relation 4915. Up to 486 conditions per place. [2023-11-06 23:11:21,418 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 45 selfloop transitions, 10 changer transitions 30/88 dead transitions. [2023-11-06 23:11:21,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 892 flow [2023-11-06 23:11:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:11:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:11:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-11-06 23:11:21,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4040447504302926 [2023-11-06 23:11:21,423 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-11-06 23:11:21,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-11-06 23:11:21,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:21,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-11-06 23:11:21,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states 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 23:11:21,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states 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 23:11:21,432 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states 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 23:11:21,432 INFO L175 Difference]: Start difference. First operand has 97 places, 74 transitions, 725 flow. Second operand 7 states and 939 transitions. [2023-11-06 23:11:21,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 892 flow [2023-11-06 23:11:21,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 88 transitions, 727 flow, removed 36 selfloop flow, removed 16 redundant places. [2023-11-06 23:11:21,456 INFO L231 Difference]: Finished difference. Result has 77 places, 37 transitions, 263 flow [2023-11-06 23:11:21,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=77, PETRI_TRANSITIONS=37} [2023-11-06 23:11:21,457 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2023-11-06 23:11:21,457 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 37 transitions, 263 flow [2023-11-06 23:11:21,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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 23:11:21,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:21,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:21,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:11:21,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:21,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1127135219, now seen corresponding path program 1 times [2023-11-06 23:11:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047938889] [2023-11-06 23:11:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:11:21,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:11:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:11:21,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:11:21,731 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:11:21,733 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-11-06 23:11:21,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-11-06 23:11:21,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-11-06 23:11:21,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-11-06 23:11:21,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-11-06 23:11:21,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-11-06 23:11:21,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-11-06 23:11:21,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-11-06 23:11:21,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-11-06 23:11:21,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-11-06 23:11:21,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-11-06 23:11:21,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-11-06 23:11:21,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-11-06 23:11:21,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-11-06 23:11:21,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-11-06 23:11:21,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-11-06 23:11:21,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-11-06 23:11:21,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-11-06 23:11:21,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-11-06 23:11:21,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-11-06 23:11:21,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-11-06 23:11:21,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-11-06 23:11:21,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-11-06 23:11:21,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-11-06 23:11:21,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-11-06 23:11:21,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-11-06 23:11:21,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-11-06 23:11:21,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-11-06 23:11:21,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-11-06 23:11:21,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-11-06 23:11:21,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-11-06 23:11:21,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-11-06 23:11:21,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-11-06 23:11:21,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-11-06 23:11:21,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-11-06 23:11:21,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-11-06 23:11:21,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-11-06 23:11:21,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-11-06 23:11:21,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-11-06 23:11:21,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-11-06 23:11:21,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-11-06 23:11:21,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-11-06 23:11:21,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-11-06 23:11:21,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-11-06 23:11:21,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-11-06 23:11:21,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-11-06 23:11:21,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-11-06 23:11:21,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-11-06 23:11:21,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-11-06 23:11:21,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-11-06 23:11:21,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-11-06 23:11:21,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-11-06 23:11:21,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-11-06 23:11:21,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-11-06 23:11:21,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-11-06 23:11:21,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-11-06 23:11:21,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-11-06 23:11:21,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-11-06 23:11:21,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-11-06 23:11:21,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-11-06 23:11:21,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-11-06 23:11:21,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-11-06 23:11:21,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-11-06 23:11:21,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-11-06 23:11:21,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-11-06 23:11:21,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-11-06 23:11:21,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-11-06 23:11:21,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-11-06 23:11:21,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-11-06 23:11:21,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-11-06 23:11:21,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-11-06 23:11:21,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-11-06 23:11:21,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-11-06 23:11:21,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-11-06 23:11:21,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-11-06 23:11:21,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-11-06 23:11:21,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-11-06 23:11:21,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:11:21,755 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:21,765 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:11:21,765 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:11:21,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:11:21 BasicIcfg [2023-11-06 23:11:21,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:11:21,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:11:21,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:11:21,903 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:11:21,903 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:35" (3/4) ... [2023-11-06 23:11:21,905 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:11:21,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:11:21,908 INFO L158 Benchmark]: Toolchain (without parser) took 48539.87ms. Allocated memory was 172.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 141.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 180.3MB. Max. memory is 16.1GB. [2023-11-06 23:11:21,908 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:21,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.89ms. Allocated memory is still 172.0MB. Free memory was 141.0MB in the beginning and 117.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 23:11:21,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.03ms. Allocated memory is still 172.0MB. Free memory was 117.1MB in the beginning and 114.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:21,909 INFO L158 Benchmark]: Boogie Preprocessor took 45.20ms. Allocated memory is still 172.0MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:11:21,909 INFO L158 Benchmark]: RCFGBuilder took 1533.74ms. Allocated memory is still 172.0MB. Free memory was 112.4MB in the beginning and 123.1MB in the end (delta: -10.7MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2023-11-06 23:11:21,910 INFO L158 Benchmark]: TraceAbstraction took 46186.65ms. Allocated memory was 172.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 123.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. [2023-11-06 23:11:21,910 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 1.9GB. Free memory is still 1.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:21,914 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.21ms. Allocated memory is still 130.0MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.89ms. Allocated memory is still 172.0MB. Free memory was 141.0MB in the beginning and 117.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.03ms. Allocated memory is still 172.0MB. Free memory was 117.1MB in the beginning and 114.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.20ms. Allocated memory is still 172.0MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1533.74ms. Allocated memory is still 172.0MB. Free memory was 112.4MB in the beginning and 123.1MB in the end (delta: -10.7MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * TraceAbstraction took 46186.65ms. Allocated memory was 172.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 123.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 1.9GB. Free memory is still 1.7GB. 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: 13.3s, 182 PlacesBefore, 79 PlacesAfterwards, 175 TransitionsBefore, 70 TransitionsAfterwards, 7168 CoEnabledTransitionPairs, 8 FixpointIterations, 61 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 154 TotalNumberOfCompositions, 35920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12216, independent: 11569, independent conditional: 0, independent unconditional: 11569, dependent: 647, dependent conditional: 0, dependent unconditional: 647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3037, independent: 2956, independent conditional: 0, independent unconditional: 2956, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12216, independent: 8613, independent conditional: 0, independent unconditional: 8613, dependent: 566, dependent conditional: 0, dependent unconditional: 566, unknown: 3037, unknown conditional: 0, unknown unconditional: 3037] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 376, Positive conditional cache size: 0, Positive unconditional cache size: 376, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1693; [L848] FCALL, FORK 0 pthread_create(&t1693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1693, ((void *)0), P0, ((void *)0))=0, t1693={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 \read(x) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L849] 0 pthread_t t1694; [L850] FCALL, FORK 0 pthread_create(&t1694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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, pthread_create(&t1694, ((void *)0), P1, ((void *)0))=1, t1693={4:0}, t1694={7:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1695; [L779] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L791] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] FCALL, FORK 0 pthread_create(&t1695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1695, ((void *)0), P2, ((void *)0))=2, t1693={4:0}, t1694={7:0}, t1695={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L822] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 2 return 0; [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L856] RET 0 assume_abort_if_not(main$tmp_guard0) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 \read(x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 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) [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 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 [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693={4:0}, t1694={7:0}, t1695={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi006_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 848]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 231 locations, 77 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: 45.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1948 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1459 mSDsluCounter, 436 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 386 mSDsCounter, 292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4493 IncrementalHoareTripleChecker+Invalid, 4785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 292 mSolverCounterUnsat, 50 mSDtfsCounter, 4493 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1487occurred in iteration=13, InterpolantAutomatonStates: 95, 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.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 2050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 23:11:21,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:11:24,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:11:25,148 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:11:25,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:11:25,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:11:25,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:11:25,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:11:25,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:11:25,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:11:25,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:11:25,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:11:25,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:11:25,217 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:11:25,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:11:25,220 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:11:25,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:11:25,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:11:25,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:11:25,223 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:11:25,224 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:11:25,225 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:11:25,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:11:25,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:11:25,226 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:11:25,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:11:25,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:11:25,228 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:11:25,228 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:11:25,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:11:25,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:11:25,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:11:25,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:11:25,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:11:25,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:11:25,233 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:11:25,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:11:25,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:11:25,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:11:25,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:11:25,235 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:11:25,235 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:11:25,236 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_dfecab7b-0634-43d2-ae87-9ddb62279a45/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_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 -> 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 [2023-11-06 23:11:25,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:11:25,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:11:25,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:11:25,709 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:11:25,710 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:11:25,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2023-11-06 23:11:29,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:11:29,404 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:11:29,404 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2023-11-06 23:11:29,424 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/data/277ddee4c/011fc88103514e6f8fdd5a0f98ea9e2b/FLAGf57497fe3 [2023-11-06 23:11:29,441 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/data/277ddee4c/011fc88103514e6f8fdd5a0f98ea9e2b [2023-11-06 23:11:29,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:11:29,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:11:29,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:11:29,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:11:29,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:11:29,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:11:29" (1/1) ... [2023-11-06 23:11:29,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379de1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:29, skipping insertion in model container [2023-11-06 23:11:29,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:11:29" (1/1) ... [2023-11-06 23:11:29,564 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:11:30,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:11:30,106 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:11:30,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:11:30,259 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:11:30,259 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:11:30,268 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:11:30,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30 WrapperNode [2023-11-06 23:11:30,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:11:30,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:11:30,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:11:30,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:11:30,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,384 INFO L138 Inliner]: procedures = 180, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-06 23:11:30,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:11:30,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:11:30,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:11:30,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:11:30,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:11:30,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:11:30,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:11:30,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:11:30,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (1/1) ... [2023-11-06 23:11:30,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:11:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:11:30,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:11:30,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:11:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 23:11:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:11:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:11:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:11:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:11:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:11:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:11:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 23:11:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:11:30,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:11:30,589 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:11:30,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:11:30,591 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:11:30,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:11:30,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:11:30,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:11:30,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:11:30,593 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 23:11:30,837 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:11:30,839 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:11:31,684 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:11:32,405 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:11:32,406 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:11:32,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:11:32 BoogieIcfgContainer [2023-11-06 23:11:32,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:11:32,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:11:32,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:11:32,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:11:32,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:11:29" (1/3) ... [2023-11-06 23:11:32,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566afabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:11:32, skipping insertion in model container [2023-11-06 23:11:32,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:11:30" (2/3) ... [2023-11-06 23:11:32,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566afabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:11:32, skipping insertion in model container [2023-11-06 23:11:32,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:11:32" (3/3) ... [2023-11-06 23:11:32,429 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2023-11-06 23:11:32,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:11:32,452 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-06 23:11:32,452 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:11:32,636 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:11:32,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 179 transitions, 370 flow [2023-11-06 23:11:32,772 INFO L124 PetriNetUnfolderBase]: 3/176 cut-off events. [2023-11-06 23:11:32,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:11:32,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 265 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2023-11-06 23:11:32,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 179 transitions, 370 flow [2023-11-06 23:11:32,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 176 transitions, 361 flow [2023-11-06 23:11:32,790 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:11:32,800 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 176 transitions, 361 flow [2023-11-06 23:11:32,804 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 176 transitions, 361 flow [2023-11-06 23:11:32,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 176 transitions, 361 flow [2023-11-06 23:11:32,853 INFO L124 PetriNetUnfolderBase]: 3/176 cut-off events. [2023-11-06 23:11:32,854 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:11:32,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 260 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2023-11-06 23:11:32,861 INFO L119 LiptonReduction]: Number of co-enabled transitions 7168 [2023-11-06 23:11:58,509 INFO L134 LiptonReduction]: Checked pairs total: 32539 [2023-11-06 23:11:58,509 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-11-06 23:11:58,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:11:58,546 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;@667a4561, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:11:58,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-11-06 23:11:58,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:11:58,548 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:11:58,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:11:58,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:58,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:11:58,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:11:58,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2023-11-06 23:11:58,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:58,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188909310] [2023-11-06 23:11:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:58,572 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 23:11:58,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:58,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:11:58,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:11:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:58,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:11:58,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:58,718 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 23:11:58,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:58,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:58,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188909310] [2023-11-06 23:11:58,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188909310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:58,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:58,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:11:58,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440813442] [2023-11-06 23:11:58,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:58,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:11:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:58,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:11:58,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:11:58,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 340 [2023-11-06 23:11:58,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 149 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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 23:11:58,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:58,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 340 [2023-11-06 23:11:58,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:02,411 INFO L124 PetriNetUnfolderBase]: 11256/15868 cut-off events. [2023-11-06 23:12:02,411 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-06 23:12:02,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31802 conditions, 15868 events. 11256/15868 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 99904 event pairs, 11256 based on Foata normal form. 0/7392 useless extension candidates. Maximal degree in co-relation 31791. Up to 15858 conditions per place. [2023-11-06 23:12:02,576 INFO L140 encePairwiseOnDemand]: 313/340 looper letters, 39 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-11-06 23:12:02,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 171 flow [2023-11-06 23:12:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:12:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:12:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 332 transitions. [2023-11-06 23:12:02,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48823529411764705 [2023-11-06 23:12:02,602 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 332 transitions. [2023-11-06 23:12:02,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 332 transitions. [2023-11-06 23:12:02,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:02,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 332 transitions. [2023-11-06 23:12:02,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.0) internal successors, (332), 2 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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 23:12:02,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 23:12:02,628 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 23:12:02,630 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 149 flow. Second operand 2 states and 332 transitions. [2023-11-06 23:12:02,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 171 flow [2023-11-06 23:12:02,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:12:02,641 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-11-06 23:12:02,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-11-06 23:12:02,650 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2023-11-06 23:12:02,651 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-11-06 23:12:02,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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 23:12:02,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:02,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 23:12:02,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:02,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:02,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:02,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:02,866 INFO L85 PathProgramCache]: Analyzing trace with hash 973072, now seen corresponding path program 1 times [2023-11-06 23:12:02,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:02,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40573312] [2023-11-06 23:12:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:02,867 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 23:12:02,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:02,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:02,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:03,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:12:03,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:03,149 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 23:12:03,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 23:12:03,182 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 23:12:03,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:03,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40573312] [2023-11-06 23:12:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40573312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:03,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:03,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:12:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177133318] [2023-11-06 23:12:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:03,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:12:03,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:03,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:12:03,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:12:03,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 340 [2023-11-06 23:12:03,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 23:12:03,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:03,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 340 [2023-11-06 23:12:03,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:05,449 INFO L124 PetriNetUnfolderBase]: 5873/8411 cut-off events. [2023-11-06 23:12:05,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:12:05,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16866 conditions, 8411 events. 5873/8411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 48912 event pairs, 3633 based on Foata normal form. 0/4670 useless extension candidates. Maximal degree in co-relation 16863. Up to 4322 conditions per place. [2023-11-06 23:12:05,507 INFO L140 encePairwiseOnDemand]: 331/340 looper letters, 48 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-06 23:12:05,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 212 flow [2023-11-06 23:12:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:12:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:12:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-11-06 23:12:05,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2023-11-06 23:12:05,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-11-06 23:12:05,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-11-06 23:12:05,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:05,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-11-06 23:12:05,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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 23:12:05,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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 23:12:05,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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 23:12:05,528 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 444 transitions. [2023-11-06 23:12:05,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 212 flow [2023-11-06 23:12:05,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:12:05,531 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 102 flow [2023-11-06 23:12:05,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-06 23:12:05,533 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2023-11-06 23:12:05,533 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 102 flow [2023-11-06 23:12:05,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 23:12:05,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:05,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 23:12:05,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:05,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:05,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:05,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash 973073, now seen corresponding path program 1 times [2023-11-06 23:12:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:05,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003046264] [2023-11-06 23:12:05,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:05,748 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 23:12:05,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:05,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:05,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:05,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 23:12:05,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:05,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:12:05,934 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 23:12:05,972 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 23:12:05,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:05,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:05,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003046264] [2023-11-06 23:12:05,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003046264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:05,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:12:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124889748] [2023-11-06 23:12:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:05,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:12:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:12:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:12:06,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 340 [2023-11-06 23:12:06,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states 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 23:12:06,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:06,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 340 [2023-11-06 23:12:06,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:06,726 INFO L124 PetriNetUnfolderBase]: 1992/2938 cut-off events. [2023-11-06 23:12:06,726 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-11-06 23:12:06,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 2938 events. 1992/2938 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 14866 event pairs, 1992 based on Foata normal form. 0/2570 useless extension candidates. Maximal degree in co-relation 6490. Up to 2931 conditions per place. [2023-11-06 23:12:06,760 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 29 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-11-06 23:12:06,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 148 flow [2023-11-06 23:12:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:12:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:12:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-06 23:12:06,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4245098039215686 [2023-11-06 23:12:06,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-06 23:12:06,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-06 23:12:06,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:06,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-06 23:12:06,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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 23:12:06,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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 23:12:06,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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 23:12:06,771 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 102 flow. Second operand 3 states and 433 transitions. [2023-11-06 23:12:06,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 148 flow [2023-11-06 23:12:06,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:06,774 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 86 flow [2023-11-06 23:12:06,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-11-06 23:12:06,776 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -35 predicate places. [2023-11-06 23:12:06,776 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 86 flow [2023-11-06 23:12:06,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states 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 23:12:06,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:06,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:06,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:06,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:06,990 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:06,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash 125006170, now seen corresponding path program 1 times [2023-11-06 23:12:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:06,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577801942] [2023-11-06 23:12:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:06,991 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 23:12:06,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:06,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:06,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:07,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:12:07,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:07,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:07,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577801942] [2023-11-06 23:12:07,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577801942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:07,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:12:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595499454] [2023-11-06 23:12:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:07,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:12:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:12:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:12:07,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 340 [2023-11-06 23:12:07,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:07,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:07,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 340 [2023-11-06 23:12:07,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:07,836 INFO L124 PetriNetUnfolderBase]: 932/1528 cut-off events. [2023-11-06 23:12:07,836 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-06 23:12:07,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3299 conditions, 1528 events. 932/1528 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7812 event pairs, 303 based on Foata normal form. 48/1383 useless extension candidates. Maximal degree in co-relation 3294. Up to 1322 conditions per place. [2023-11-06 23:12:07,847 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 39 selfloop transitions, 4 changer transitions 17/63 dead transitions. [2023-11-06 23:12:07,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 270 flow [2023-11-06 23:12:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:12:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:12:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-11-06 23:12:07,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2023-11-06 23:12:07,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-11-06 23:12:07,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-11-06 23:12:07,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:07,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-11-06 23:12:07,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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 23:12:07,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states 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 23:12:07,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states 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 23:12:07,864 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 86 flow. Second operand 5 states and 697 transitions. [2023-11-06 23:12:07,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 270 flow [2023-11-06 23:12:07,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:12:07,866 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 121 flow [2023-11-06 23:12:07,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-11-06 23:12:07,868 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2023-11-06 23:12:07,868 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 121 flow [2023-11-06 23:12:07,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:07,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:07,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:07,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:08,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:08,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:08,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash 348759610, now seen corresponding path program 1 times [2023-11-06 23:12:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:08,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655548575] [2023-11-06 23:12:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:08,086 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 23:12:08,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:08,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:08,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:08,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:12:08,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:08,351 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 23:12:08,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:08,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655548575] [2023-11-06 23:12:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655548575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:08,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:08,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:12:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46599933] [2023-11-06 23:12:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:08,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:12:08,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:08,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:12:08,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:12:08,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 340 [2023-11-06 23:12:08,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:08,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:08,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 340 [2023-11-06 23:12:08,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:08,922 INFO L124 PetriNetUnfolderBase]: 248/484 cut-off events. [2023-11-06 23:12:08,922 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2023-11-06 23:12:08,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 484 events. 248/484 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2016 event pairs, 64 based on Foata normal form. 30/466 useless extension candidates. Maximal degree in co-relation 1298. Up to 239 conditions per place. [2023-11-06 23:12:08,926 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 47 selfloop transitions, 7 changer transitions 17/74 dead transitions. [2023-11-06 23:12:08,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 383 flow [2023-11-06 23:12:08,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:12:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:12:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 835 transitions. [2023-11-06 23:12:08,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40931372549019607 [2023-11-06 23:12:08,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 835 transitions. [2023-11-06 23:12:08,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 835 transitions. [2023-11-06 23:12:08,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:08,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 835 transitions. [2023-11-06 23:12:08,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 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 23:12:08,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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 23:12:08,944 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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 23:12:08,945 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 121 flow. Second operand 6 states and 835 transitions. [2023-11-06 23:12:08,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 383 flow [2023-11-06 23:12:08,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 377 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:08,953 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 171 flow [2023-11-06 23:12:08,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-11-06 23:12:08,957 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -25 predicate places. [2023-11-06 23:12:08,957 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 171 flow [2023-11-06 23:12:08,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:08,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:08,959 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 23:12:08,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:09,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:09,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:09,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1100701655, now seen corresponding path program 1 times [2023-11-06 23:12:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880300009] [2023-11-06 23:12:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:09,184 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 23:12:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:09,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:09,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:09,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:12:09,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:09,456 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 23:12:09,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:09,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:09,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880300009] [2023-11-06 23:12:09,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880300009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:09,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:09,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:12:09,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488847165] [2023-11-06 23:12:09,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:09,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:12:09,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:09,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:12:09,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:12:09,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 340 [2023-11-06 23:12:09,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 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 23:12:09,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:09,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 340 [2023-11-06 23:12:09,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:10,020 INFO L124 PetriNetUnfolderBase]: 119/234 cut-off events. [2023-11-06 23:12:10,020 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2023-11-06 23:12:10,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 234 events. 119/234 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 785 event pairs, 39 based on Foata normal form. 9/236 useless extension candidates. Maximal degree in co-relation 708. Up to 90 conditions per place. [2023-11-06 23:12:10,022 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 38 selfloop transitions, 10 changer transitions 10/61 dead transitions. [2023-11-06 23:12:10,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 355 flow [2023-11-06 23:12:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:12:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:12:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2023-11-06 23:12:10,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39873949579831935 [2023-11-06 23:12:10,028 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2023-11-06 23:12:10,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2023-11-06 23:12:10,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:10,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2023-11-06 23:12:10,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.57142857142858) internal successors, (949), 7 states have internal predecessors, (949), 0 states have call successors, (0), 0 states 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 23:12:10,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 340.0) internal successors, (2720), 8 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states 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 23:12:10,039 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 340.0) internal successors, (2720), 8 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states 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 23:12:10,040 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 171 flow. Second operand 7 states and 949 transitions. [2023-11-06 23:12:10,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 355 flow [2023-11-06 23:12:10,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 317 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-11-06 23:12:10,045 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 149 flow [2023-11-06 23:12:10,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-11-06 23:12:10,046 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2023-11-06 23:12:10,046 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 149 flow [2023-11-06 23:12:10,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 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 23:12:10,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:10,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:10,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:10,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:10,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:10,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1156935361, now seen corresponding path program 1 times [2023-11-06 23:12:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:10,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602581938] [2023-11-06 23:12:10,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:10,266 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 23:12:10,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:10,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:10,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:10,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:12:10,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:10,564 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 23:12:10,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:10,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602581938] [2023-11-06 23:12:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602581938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:10,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:12:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724666470] [2023-11-06 23:12:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:10,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:12:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:12:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:12:10,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 340 [2023-11-06 23:12:10,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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 23:12:10,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:10,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 340 [2023-11-06 23:12:10,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:10,909 INFO L124 PetriNetUnfolderBase]: 112/217 cut-off events. [2023-11-06 23:12:10,910 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2023-11-06 23:12:10,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 217 events. 112/217 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 746 event pairs, 69 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 642. Up to 159 conditions per place. [2023-11-06 23:12:10,911 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 40 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-06 23:12:10,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 283 flow [2023-11-06 23:12:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:12:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:12:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-11-06 23:12:10,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39926470588235297 [2023-11-06 23:12:10,916 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-11-06 23:12:10,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-11-06 23:12:10,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:10,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-11-06 23:12:10,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 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 23:12:10,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states 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 23:12:10,922 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states 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 23:12:10,923 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 149 flow. Second operand 4 states and 543 transitions. [2023-11-06 23:12:10,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 283 flow [2023-11-06 23:12:10,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 239 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-06 23:12:10,926 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 113 flow [2023-11-06 23:12:10,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 23:12:10,928 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -35 predicate places. [2023-11-06 23:12:10,928 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 113 flow [2023-11-06 23:12:10,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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 23:12:10,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:10,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:10,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:11,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:11,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:11,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:11,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2041715488, now seen corresponding path program 1 times [2023-11-06 23:12:11,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:11,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347666796] [2023-11-06 23:12:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:11,145 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 23:12:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:11,146 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:11,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:11,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:12:11,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:11,542 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 23:12:11,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:11,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:11,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347666796] [2023-11-06 23:12:11,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347666796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:11,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:11,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:12:11,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192619351] [2023-11-06 23:12:11,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:11,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:12:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:12:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:12:11,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 340 [2023-11-06 23:12:11,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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 23:12:11,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:11,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 340 [2023-11-06 23:12:11,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:11,910 INFO L124 PetriNetUnfolderBase]: 112/241 cut-off events. [2023-11-06 23:12:11,910 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2023-11-06 23:12:11,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 241 events. 112/241 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 957 event pairs, 17 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 642. Up to 161 conditions per place. [2023-11-06 23:12:11,912 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 39 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-06 23:12:11,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 239 flow [2023-11-06 23:12:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:12:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:12:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-11-06 23:12:11,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4073529411764706 [2023-11-06 23:12:11,917 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-11-06 23:12:11,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-11-06 23:12:11,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:11,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-11-06 23:12:11,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 23:12:11,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states 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 23:12:11,924 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states 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 23:12:11,925 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 113 flow. Second operand 4 states and 554 transitions. [2023-11-06 23:12:11,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 239 flow [2023-11-06 23:12:11,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:11,930 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2023-11-06 23:12:11,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-06 23:12:11,933 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -35 predicate places. [2023-11-06 23:12:11,933 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2023-11-06 23:12:11,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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 23:12:11,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:11,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:11,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:12,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:12,153 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:12,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1837271991, now seen corresponding path program 1 times [2023-11-06 23:12:12,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805432354] [2023-11-06 23:12:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:12,155 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 23:12:12,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:12,157 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:12,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 23:12:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:12,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:12:12,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:12,458 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 23:12:12,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:12,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:12,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805432354] [2023-11-06 23:12:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805432354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:12:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167004643] [2023-11-06 23:12:12,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:12,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:12:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:12,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:12:12,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:12:12,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 340 [2023-11-06 23:12:12,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 23:12:12,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:12,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 340 [2023-11-06 23:12:12,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:12,813 INFO L124 PetriNetUnfolderBase]: 202/394 cut-off events. [2023-11-06 23:12:12,814 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2023-11-06 23:12:12,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 394 events. 202/394 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1768 event pairs, 17 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 1091. Up to 183 conditions per place. [2023-11-06 23:12:12,817 INFO L140 encePairwiseOnDemand]: 336/340 looper letters, 63 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2023-11-06 23:12:12,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 379 flow [2023-11-06 23:12:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:12:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:12:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-11-06 23:12:12,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4183823529411765 [2023-11-06 23:12:12,822 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-11-06 23:12:12,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-11-06 23:12:12,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:12,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-11-06 23:12:12,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:12:12,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states 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 23:12:12,829 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states 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 23:12:12,830 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 4 states and 569 transitions. [2023-11-06 23:12:12,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 379 flow [2023-11-06 23:12:12,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:12,834 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 123 flow [2023-11-06 23:12:12,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-11-06 23:12:12,835 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -33 predicate places. [2023-11-06 23:12:12,835 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 123 flow [2023-11-06 23:12:12,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 23:12:12,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:12,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:12,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-06 23:12:13,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:13,050 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:13,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1054818201, now seen corresponding path program 2 times [2023-11-06 23:12:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:13,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501353349] [2023-11-06 23:12:13,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:12:13,051 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 23:12:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:13,052 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:13,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 23:12:13,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:12:13,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:12:13,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 23:12:13,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:13,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:12:13,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 23:12:13,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:12:13,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-11-06 23:12:14,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 23:12:14,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 23:12:14,873 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 23:12:14,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:12:14,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:12:14,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501353349] [2023-11-06 23:12:14,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501353349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:14,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:14,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:12:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184356487] [2023-11-06 23:12:14,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:14,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:12:14,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:12:14,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:12:14,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:12:16,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 340 [2023-11-06 23:12:16,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 23:12:16,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:16,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 340 [2023-11-06 23:12:16,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:17,462 INFO L124 PetriNetUnfolderBase]: 215/449 cut-off events. [2023-11-06 23:12:17,463 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2023-11-06 23:12:17,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1399 conditions, 449 events. 215/449 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2069 event pairs, 84 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 1391. Up to 171 conditions per place. [2023-11-06 23:12:17,467 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 60 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2023-11-06 23:12:17,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 432 flow [2023-11-06 23:12:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:12:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:12:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2023-11-06 23:12:17,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3689075630252101 [2023-11-06 23:12:17,473 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2023-11-06 23:12:17,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2023-11-06 23:12:17,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:17,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2023-11-06 23:12:17,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states 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 23:12:17,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 340.0) internal successors, (2720), 8 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states 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 23:12:17,485 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 340.0) internal successors, (2720), 8 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states 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 23:12:17,485 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 123 flow. Second operand 7 states and 878 transitions. [2023-11-06 23:12:17,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 432 flow [2023-11-06 23:12:17,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:17,491 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 160 flow [2023-11-06 23:12:17,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-11-06 23:12:17,492 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -26 predicate places. [2023-11-06 23:12:17,493 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 160 flow [2023-11-06 23:12:17,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 23:12:17,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:17,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:17,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:12:17,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:17,708 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-06 23:12:17,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash 730476019, now seen corresponding path program 3 times [2023-11-06 23:12:17,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:12:17,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023419842] [2023-11-06 23:12:17,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:12:17,710 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 23:12:17,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:12:17,711 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:17,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 (12)] Waiting until timeout for monitored process [2023-11-06 23:12:18,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:12:18,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:12:18,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:12:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:12:18,359 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:12:18,359 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:12:18,361 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-11-06 23:12:18,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-11-06 23:12:18,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-11-06 23:12:18,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-11-06 23:12:18,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-11-06 23:12:18,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-11-06 23:12:18,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-11-06 23:12:18,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-11-06 23:12:18,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-11-06 23:12:18,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-11-06 23:12:18,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-11-06 23:12:18,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-11-06 23:12:18,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-11-06 23:12:18,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-11-06 23:12:18,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-11-06 23:12:18,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-11-06 23:12:18,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-11-06 23:12:18,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-11-06 23:12:18,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-11-06 23:12:18,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-11-06 23:12:18,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-11-06 23:12:18,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-11-06 23:12:18,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-11-06 23:12:18,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-11-06 23:12:18,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-11-06 23:12:18,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-11-06 23:12:18,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-11-06 23:12:18,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-11-06 23:12:18,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-11-06 23:12:18,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-11-06 23:12:18,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-11-06 23:12:18,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-11-06 23:12:18,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-11-06 23:12:18,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-11-06 23:12:18,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-11-06 23:12:18,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-11-06 23:12:18,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-11-06 23:12:18,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-11-06 23:12:18,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-11-06 23:12:18,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-11-06 23:12:18,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-11-06 23:12:18,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-11-06 23:12:18,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-11-06 23:12:18,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-11-06 23:12:18,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-11-06 23:12:18,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-11-06 23:12:18,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-11-06 23:12:18,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-11-06 23:12:18,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-11-06 23:12:18,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-11-06 23:12:18,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-11-06 23:12:18,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-11-06 23:12:18,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-11-06 23:12:18,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-11-06 23:12:18,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-11-06 23:12:18,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-11-06 23:12:18,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-11-06 23:12:18,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-11-06 23:12:18,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-11-06 23:12:18,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-11-06 23:12:18,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-11-06 23:12:18,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-11-06 23:12:18,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-11-06 23:12:18,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-11-06 23:12:18,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-11-06 23:12:18,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-11-06 23:12:18,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-11-06 23:12:18,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-11-06 23:12:18,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-11-06 23:12:18,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-11-06 23:12:18,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-11-06 23:12:18,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-11-06 23:12:18,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-11-06 23:12:18,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-11-06 23:12:18,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-11-06 23:12:18,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-11-06 23:12:18,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-11-06 23:12:18,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 (12)] Forceful destruction successful, exit code 0 [2023-11-06 23:12:18,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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 23:12:18,600 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:12:18,608 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:12:18,608 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:12:18,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:12:18 BasicIcfg [2023-11-06 23:12:18,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:12:18,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:12:18,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:12:18,766 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:12:18,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:11:32" (3/4) ... [2023-11-06 23:12:18,769 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:12:18,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:12:18,771 INFO L158 Benchmark]: Toolchain (without parser) took 49325.19ms. Allocated memory was 62.9MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 28.0MB in the beginning and 961.8MB in the end (delta: -933.8MB). Peak memory consumption was 626.1MB. Max. memory is 16.1GB. [2023-11-06 23:12:18,772 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 62.9MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:12:18,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 821.33ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 27.8MB in the beginning and 48.0MB in the end (delta: -20.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-11-06 23:12:18,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.48ms. Allocated memory is still 92.3MB. Free memory was 48.0MB in the beginning and 68.5MB in the end (delta: -20.5MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2023-11-06 23:12:18,775 INFO L158 Benchmark]: Boogie Preprocessor took 99.23ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:12:18,776 INFO L158 Benchmark]: RCFGBuilder took 1924.13ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 66.0MB in the beginning and 57.3MB in the end (delta: 8.6MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2023-11-06 23:12:18,776 INFO L158 Benchmark]: TraceAbstraction took 46348.27ms. Allocated memory was 111.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 56.2MB in the beginning and 962.8MB in the end (delta: -906.6MB). Peak memory consumption was 605.4MB. Max. memory is 16.1GB. [2023-11-06 23:12:18,777 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 1.6GB. Free memory is still 961.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:12:18,780 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.32ms. Allocated memory is still 62.9MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 821.33ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 27.8MB in the beginning and 48.0MB in the end (delta: -20.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.48ms. Allocated memory is still 92.3MB. Free memory was 48.0MB in the beginning and 68.5MB in the end (delta: -20.5MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.23ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1924.13ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 66.0MB in the beginning and 57.3MB in the end (delta: 8.6MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 46348.27ms. Allocated memory was 111.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 56.2MB in the beginning and 962.8MB in the end (delta: -906.6MB). Peak memory consumption was 605.4MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 1.6GB. Free memory is still 961.8MB. 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: 25.7s, 183 PlacesBefore, 79 PlacesAfterwards, 176 TransitionsBefore, 70 TransitionsAfterwards, 7168 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 161 TotalNumberOfCompositions, 32539 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10643, independent: 10074, independent conditional: 0, independent unconditional: 10074, dependent: 569, dependent conditional: 0, dependent unconditional: 569, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2971, independent: 2897, independent conditional: 0, independent unconditional: 2897, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10643, independent: 7177, independent conditional: 0, independent unconditional: 7177, dependent: 495, dependent conditional: 0, dependent unconditional: 495, unknown: 2971, unknown conditional: 0, unknown unconditional: 2971] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 315, Positive conditional cache size: 0, Positive unconditional cache size: 315, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1693; [L848] FCALL, FORK 0 pthread_create(&t1693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1693, ((void *)0), P0, ((void *)0))=0, t1693={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 \read(x) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L779] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L849] 0 pthread_t t1694; [L850] FCALL, FORK 0 pthread_create(&t1694, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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, pthread_create(&t1694, ((void *)0), P1, ((void *)0))=1, t1693={-2147483642:0}, t1694={6:0}, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L851] 0 pthread_t t1695; [L791] 2 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L794] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] FCALL, FORK 0 pthread_create(&t1695, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1695, ((void *)0), P2, ((void *)0))=2, t1693={-2147483642:0}, t1694={6:0}, t1695={7:0}, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 2 return 0; [L822] 3 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L856] RET 0 assume_abort_if_not(main$tmp_guard0) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 \read(x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 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) [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 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 [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693={-2147483642:0}, t1694={6:0}, t1695={7:0}, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi006_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 848]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 232 locations, 77 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: 45.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 771 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 234 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1657 IncrementalHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 100 mSDtfsCounter, 1657 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=5, InterpolantAutomatonStates: 45, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 5 QuantifiedInterpolants, 1036 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1399 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 23:12:18,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfecab7b-0634-43d2-ae87-9ddb62279a45/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