./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:16:38,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:16:38,529 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:16:38,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:16:38,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:16:38,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:16:38,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:16:38,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:16:38,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:16:38,581 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:16:38,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:16:38,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:16:38,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:16:38,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:16:38,584 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:16:38,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:16:38,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:16:38,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:16:38,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:16:38,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:16:38,584 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:16:38,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:16:38,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:16:38,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:16:38,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:16:38,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:16:38,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:16:38,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:16:38,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:16:38,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:16:38,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:16:38,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:16:38,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:16:38,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:16:38,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf [2024-11-13 13:16:38,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:16:38,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:16:38,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:16:38,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:16:38,892 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:16:38,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i Unable to find full path for "g++" [2024-11-13 13:16:40,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:16:41,390 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:16:41,392 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2024-11-13 13:16:41,412 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/data/1960033f8/77b886d3058843cc9b9e79dc3bffab80/FLAG63f77d713 [2024-11-13 13:16:41,435 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/data/1960033f8/77b886d3058843cc9b9e79dc3bffab80 [2024-11-13 13:16:41,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:16:41,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:16:41,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:16:41,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:16:41,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:16:41,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:16:41" (1/1) ... [2024-11-13 13:16:41,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3e3186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:41, skipping insertion in model container [2024-11-13 13:16:41,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:16:41" (1/1) ... [2024-11-13 13:16:41,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:16:41,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:16:41,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:16:42,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:16:42,127 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:16:42,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42 WrapperNode [2024-11-13 13:16:42,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:16:42,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:16:42,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:16:42,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:16:42,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,197 INFO L138 Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2024-11-13 13:16:42,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:16:42,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:16:42,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:16:42,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:16:42,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,240 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:16:42,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:16:42,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:16:42,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:16:42,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:16:42,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (1/1) ... [2024-11-13 13:16:42,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:16:42,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:16:42,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:16:42,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:16:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 13:16:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:16:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 13:16:42,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 13:16:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 13:16:42,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 13:16:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:16:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 13:16:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:16:42,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:16:42,346 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 13:16:42,482 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:16:42,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:16:42,927 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:16:42,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:16:43,272 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:16:43,272 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:16:43,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:16:43 BoogieIcfgContainer [2024-11-13 13:16:43,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:16:43,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:16:43,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:16:43,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:16:43,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:16:41" (1/3) ... [2024-11-13 13:16:43,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3755fad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:16:43, skipping insertion in model container [2024-11-13 13:16:43,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:42" (2/3) ... [2024-11-13 13:16:43,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3755fad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:16:43, skipping insertion in model container [2024-11-13 13:16:43,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:16:43" (3/3) ... [2024-11-13 13:16:43,286 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2024-11-13 13:16:43,306 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:16:43,308 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix031.oepc.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 13:16:43,308 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:16:43,381 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 13:16:43,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 86 flow [2024-11-13 13:16:43,473 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2024-11-13 13:16:43,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:16:43,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 2/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-13 13:16:43,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 86 flow [2024-11-13 13:16:43,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 37 transitions, 80 flow [2024-11-13 13:16:43,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:16:43,514 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@391619f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:16:43,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-13 13:16:43,519 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:16:43,520 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 13:16:43,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:16:43,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:43,521 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 13:16:43,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:43,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:43,530 INFO L85 PathProgramCache]: Analyzing trace with hash 11132310, now seen corresponding path program 1 times [2024-11-13 13:16:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:43,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643748883] [2024-11-13 13:16:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:44,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:44,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643748883] [2024-11-13 13:16:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643748883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:44,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:44,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:16:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788521067] [2024-11-13 13:16:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:44,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:16:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:16:44,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:16:44,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-11-13 13:16:44,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:44,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:44,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-11-13 13:16:44,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:44,538 INFO L124 PetriNetUnfolderBase]: 183/483 cut-off events. [2024-11-13 13:16:44,539 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 13:16:44,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 483 events. 183/483 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2797 event pairs, 21 based on Foata normal form. 32/510 useless extension candidates. Maximal degree in co-relation 807. Up to 265 conditions per place. [2024-11-13 13:16:44,544 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 25 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2024-11-13 13:16:44,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 157 flow [2024-11-13 13:16:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:16:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:16:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-13 13:16:44,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2024-11-13 13:16:44,568 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 80 flow. Second operand 3 states and 88 transitions. [2024-11-13 13:16:44,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 157 flow [2024-11-13 13:16:44,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:16:44,576 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2024-11-13 13:16:44,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-11-13 13:16:44,583 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2024-11-13 13:16:44,584 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2024-11-13 13:16:44,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:44,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:44,586 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:44,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:16:44,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:44,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash -586911496, now seen corresponding path program 1 times [2024-11-13 13:16:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:44,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934184993] [2024-11-13 13:16:44,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:44,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934184993] [2024-11-13 13:16:44,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934184993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:44,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:44,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:16:44,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482902728] [2024-11-13 13:16:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:44,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:16:44,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:16:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:16:44,742 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-11-13 13:16:44,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:44,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:44,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-11-13 13:16:44,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:44,885 INFO L124 PetriNetUnfolderBase]: 159/381 cut-off events. [2024-11-13 13:16:44,885 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-13 13:16:44,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 381 events. 159/381 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2116 event pairs, 159 based on Foata normal form. 16/380 useless extension candidates. Maximal degree in co-relation 695. Up to 280 conditions per place. [2024-11-13 13:16:44,889 INFO L140 encePairwiseOnDemand]: 37/39 looper letters, 14 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-11-13 13:16:44,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 102 flow [2024-11-13 13:16:44,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:16:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:16:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-13 13:16:44,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2024-11-13 13:16:44,891 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 3 states and 68 transitions. [2024-11-13 13:16:44,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 102 flow [2024-11-13 13:16:44,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:16:44,892 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 66 flow [2024-11-13 13:16:44,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-13 13:16:44,893 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-11-13 13:16:44,893 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 66 flow [2024-11-13 13:16:44,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:44,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:44,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:44,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:16:44,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -586910067, now seen corresponding path program 1 times [2024-11-13 13:16:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196533572] [2024-11-13 13:16:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196533572] [2024-11-13 13:16:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196533572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:45,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:45,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:16:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341538513] [2024-11-13 13:16:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:45,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:16:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:16:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:16:45,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-13 13:16:45,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:45,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:45,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-13 13:16:45,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:45,928 INFO L124 PetriNetUnfolderBase]: 476/918 cut-off events. [2024-11-13 13:16:45,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:16:45,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 918 events. 476/918 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5230 event pairs, 176 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1741. Up to 512 conditions per place. [2024-11-13 13:16:45,938 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 24 selfloop transitions, 3 changer transitions 39/76 dead transitions. [2024-11-13 13:16:45,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 76 transitions, 292 flow [2024-11-13 13:16:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:16:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 13:16:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-11-13 13:16:45,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2024-11-13 13:16:45,942 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 66 flow. Second operand 8 states and 172 transitions. [2024-11-13 13:16:45,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 76 transitions, 292 flow [2024-11-13 13:16:45,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 76 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:16:45,946 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 98 flow [2024-11-13 13:16:45,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2024-11-13 13:16:45,949 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-11-13 13:16:45,949 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 98 flow [2024-11-13 13:16:45,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:45,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:45,950 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:45,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:16:45,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:45,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash -228803062, now seen corresponding path program 1 times [2024-11-13 13:16:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:45,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393212740] [2024-11-13 13:16:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:46,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393212740] [2024-11-13 13:16:46,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393212740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:46,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:46,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:16:46,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335523781] [2024-11-13 13:16:46,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:46,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:16:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:46,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:16:46,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:16:46,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-13 13:16:46,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:46,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:46,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-13 13:16:46,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:46,753 INFO L124 PetriNetUnfolderBase]: 337/682 cut-off events. [2024-11-13 13:16:46,754 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2024-11-13 13:16:46,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 682 events. 337/682 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3513 event pairs, 79 based on Foata normal form. 20/694 useless extension candidates. Maximal degree in co-relation 1624. Up to 435 conditions per place. [2024-11-13 13:16:46,760 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 25 selfloop transitions, 3 changer transitions 23/61 dead transitions. [2024-11-13 13:16:46,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 282 flow [2024-11-13 13:16:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:16:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:16:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-11-13 13:16:46,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-11-13 13:16:46,762 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 98 flow. Second operand 7 states and 143 transitions. [2024-11-13 13:16:46,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 282 flow [2024-11-13 13:16:46,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 265 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-13 13:16:46,771 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 108 flow [2024-11-13 13:16:46,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2024-11-13 13:16:46,771 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-11-13 13:16:46,772 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 108 flow [2024-11-13 13:16:46,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:46,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:46,772 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:46,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:16:46,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:46,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1972854197, now seen corresponding path program 1 times [2024-11-13 13:16:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152986100] [2024-11-13 13:16:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:47,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:47,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152986100] [2024-11-13 13:16:47,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152986100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:47,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:47,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:16:47,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192495594] [2024-11-13 13:16:47,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:47,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:16:47,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:47,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:16:47,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:16:47,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-13 13:16:47,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:47,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:47,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-13 13:16:47,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:47,396 INFO L124 PetriNetUnfolderBase]: 218/477 cut-off events. [2024-11-13 13:16:47,396 INFO L125 PetriNetUnfolderBase]: For 429/430 co-relation queries the response was YES. [2024-11-13 13:16:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 477 events. 218/477 cut-off events. For 429/430 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2403 event pairs, 110 based on Foata normal form. 20/484 useless extension candidates. Maximal degree in co-relation 1144. Up to 224 conditions per place. [2024-11-13 13:16:47,399 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 23 selfloop transitions, 3 changer transitions 23/62 dead transitions. [2024-11-13 13:16:47,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 298 flow [2024-11-13 13:16:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:16:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:16:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2024-11-13 13:16:47,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5677655677655677 [2024-11-13 13:16:47,402 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 108 flow. Second operand 7 states and 155 transitions. [2024-11-13 13:16:47,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 298 flow [2024-11-13 13:16:47,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 268 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-11-13 13:16:47,410 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 109 flow [2024-11-13 13:16:47,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2024-11-13 13:16:47,411 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2024-11-13 13:16:47,411 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 109 flow [2024-11-13 13:16:47,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:47,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:47,411 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:47,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:16:47,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:47,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:47,412 INFO L85 PathProgramCache]: Analyzing trace with hash 589751112, now seen corresponding path program 1 times [2024-11-13 13:16:47,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:47,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636779755] [2024-11-13 13:16:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:47,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:47,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636779755] [2024-11-13 13:16:47,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636779755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:47,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:47,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:16:47,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257015001] [2024-11-13 13:16:47,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:47,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:16:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:47,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:16:47,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:16:47,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-13 13:16:47,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:47,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:47,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-13 13:16:47,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:47,768 INFO L124 PetriNetUnfolderBase]: 202/441 cut-off events. [2024-11-13 13:16:47,768 INFO L125 PetriNetUnfolderBase]: For 172/174 co-relation queries the response was YES. [2024-11-13 13:16:47,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 441 events. 202/441 cut-off events. For 172/174 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1981 event pairs, 42 based on Foata normal form. 29/454 useless extension candidates. Maximal degree in co-relation 973. Up to 190 conditions per place. [2024-11-13 13:16:47,772 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 32 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2024-11-13 13:16:47,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 219 flow [2024-11-13 13:16:47,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:16:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:16:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-13 13:16:47,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2024-11-13 13:16:47,773 INFO L175 Difference]: Start difference. First operand has 51 places, 31 transitions, 109 flow. Second operand 4 states and 98 transitions. [2024-11-13 13:16:47,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 219 flow [2024-11-13 13:16:47,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 199 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-13 13:16:47,776 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 119 flow [2024-11-13 13:16:47,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-13 13:16:47,777 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-11-13 13:16:47,777 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 119 flow [2024-11-13 13:16:47,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:47,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:47,778 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:47,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:16:47,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 760489293, now seen corresponding path program 1 times [2024-11-13 13:16:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575376817] [2024-11-13 13:16:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:48,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:48,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575376817] [2024-11-13 13:16:48,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575376817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:48,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:48,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:16:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769081692] [2024-11-13 13:16:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:48,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:16:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:16:48,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:16:48,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-13 13:16:48,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:48,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:48,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-13 13:16:48,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:48,242 INFO L124 PetriNetUnfolderBase]: 134/299 cut-off events. [2024-11-13 13:16:48,242 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-13 13:16:48,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 299 events. 134/299 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1177 event pairs, 43 based on Foata normal form. 18/300 useless extension candidates. Maximal degree in co-relation 719. Up to 117 conditions per place. [2024-11-13 13:16:48,244 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 28 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-11-13 13:16:48,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 218 flow [2024-11-13 13:16:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:16:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:16:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-13 13:16:48,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-11-13 13:16:48,246 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 119 flow. Second operand 5 states and 111 transitions. [2024-11-13 13:16:48,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 218 flow [2024-11-13 13:16:48,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 203 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-13 13:16:48,248 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 134 flow [2024-11-13 13:16:48,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2024-11-13 13:16:48,249 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2024-11-13 13:16:48,249 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 134 flow [2024-11-13 13:16:48,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:48,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:48,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:48,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:16:48,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:48,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1618141854, now seen corresponding path program 1 times [2024-11-13 13:16:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955738104] [2024-11-13 13:16:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:48,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:49,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:49,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955738104] [2024-11-13 13:16:49,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955738104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:49,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:16:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537493572] [2024-11-13 13:16:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:49,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:16:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:16:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:16:49,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-11-13 13:16:49,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:49,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:49,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-11-13 13:16:49,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:49,776 INFO L124 PetriNetUnfolderBase]: 147/406 cut-off events. [2024-11-13 13:16:49,776 INFO L125 PetriNetUnfolderBase]: For 326/362 co-relation queries the response was YES. [2024-11-13 13:16:49,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 406 events. 147/406 cut-off events. For 326/362 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2115 event pairs, 60 based on Foata normal form. 10/380 useless extension candidates. Maximal degree in co-relation 981. Up to 127 conditions per place. [2024-11-13 13:16:49,779 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 23 selfloop transitions, 6 changer transitions 17/65 dead transitions. [2024-11-13 13:16:49,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 306 flow [2024-11-13 13:16:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:16:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 13:16:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2024-11-13 13:16:49,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5608974358974359 [2024-11-13 13:16:49,781 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 134 flow. Second operand 8 states and 175 transitions. [2024-11-13 13:16:49,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 306 flow [2024-11-13 13:16:49,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 297 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-13 13:16:49,784 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 170 flow [2024-11-13 13:16:49,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2024-11-13 13:16:49,784 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-11-13 13:16:49,785 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 170 flow [2024-11-13 13:16:49,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:49,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:49,785 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:16:49,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash -664899734, now seen corresponding path program 2 times [2024-11-13 13:16:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645423999] [2024-11-13 13:16:49,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645423999] [2024-11-13 13:16:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645423999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:16:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847579993] [2024-11-13 13:16:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:50,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:16:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:16:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:16:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:16:50,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-13 13:16:50,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 170 flow. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:50,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:50,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-13 13:16:50,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:51,520 INFO L124 PetriNetUnfolderBase]: 289/674 cut-off events. [2024-11-13 13:16:51,521 INFO L125 PetriNetUnfolderBase]: For 443/479 co-relation queries the response was YES. [2024-11-13 13:16:51,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 674 events. 289/674 cut-off events. For 443/479 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3753 event pairs, 65 based on Foata normal form. 12/638 useless extension candidates. Maximal degree in co-relation 1801. Up to 218 conditions per place. [2024-11-13 13:16:51,525 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 34 selfloop transitions, 20 changer transitions 27/94 dead transitions. [2024-11-13 13:16:51,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 523 flow [2024-11-13 13:16:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:16:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 13:16:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2024-11-13 13:16:51,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-13 13:16:51,526 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 170 flow. Second operand 12 states and 216 transitions. [2024-11-13 13:16:51,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 523 flow [2024-11-13 13:16:51,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 513 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-13 13:16:51,534 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 272 flow [2024-11-13 13:16:51,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=272, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2024-11-13 13:16:51,535 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-11-13 13:16:51,536 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 272 flow [2024-11-13 13:16:51,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:51,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:51,536 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:51,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:16:51,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:51,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1632058644, now seen corresponding path program 3 times [2024-11-13 13:16:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:51,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639697090] [2024-11-13 13:16:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:16:51,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:16:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:16:51,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:16:51,824 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:16:51,825 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-13 13:16:51,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-13 13:16:51,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-13 13:16:51,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-13 13:16:51,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-13 13:16:51,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-13 13:16:51,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:16:51,828 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:51,900 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 13:16:51,900 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:16:51,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:16:51 BasicIcfg [2024-11-13 13:16:51,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:16:51,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:16:51,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:16:51,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:16:51,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:16:43" (3/4) ... [2024-11-13 13:16:51,913 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:16:51,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:16:51,915 INFO L158 Benchmark]: Toolchain (without parser) took 10472.89ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 117.2MB in the beginning and 247.2MB in the end (delta: -130.0MB). Peak memory consumption was 142.8MB. Max. memory is 16.1GB. [2024-11-13 13:16:51,915 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 167.8MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:16:51,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.66ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 94.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:16:51,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.88ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:16:51,916 INFO L158 Benchmark]: Boogie Preprocessor took 70.61ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:16:51,917 INFO L158 Benchmark]: RCFGBuilder took 1001.37ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 112.4MB in the end (delta: -23.1MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-11-13 13:16:51,918 INFO L158 Benchmark]: TraceAbstraction took 8633.61ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 111.6MB in the beginning and 247.2MB in the end (delta: -135.6MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2024-11-13 13:16:51,918 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 411.0MB. Free memory was 247.2MB in the beginning and 247.2MB in the end (delta: 54.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:16:51,921 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 167.8MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 685.66ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 94.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.88ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.61ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1001.37ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 112.4MB in the end (delta: -23.1MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8633.61ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 111.6MB in the beginning and 247.2MB in the end (delta: -135.6MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 411.0MB. Free memory was 247.2MB in the beginning and 247.2MB in the end (delta: 54.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L829] 0 pthread_t t834; [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833=-2, t834=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] 2 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=-2, t834=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=-2, t834=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=-2, t834=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix031.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 6 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: 8.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 902 IncrementalHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 23 mSDtfsCounter, 902 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=9, InterpolantAutomatonStates: 57, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 13:16:51,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:16:54,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:16:54,882 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 13:16:54,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:16:54,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:16:54,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:16:54,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:16:54,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:16:54,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:16:54,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:16:54,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:16:54,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:16:54,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:16:54,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:16:54,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:16:54,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:16:54,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:16:54,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:16:54,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:16:54,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:16:54,948 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:16:54,949 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:16:54,949 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:16:54,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:16:54,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:16:54,949 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:16:54,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:16:54,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:16:54,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:16:54,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:16:54,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:16:54,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:16:54,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:16:54,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:16:54,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:16:54,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:16:54,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:16:54,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:16:54,952 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:16:54,952 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:16:54,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:16:54,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:16:54,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:16:54,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:16:54,952 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf [2024-11-13 13:16:55,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:16:55,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:16:55,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:16:55,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:16:55,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:16:55,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i Unable to find full path for "g++" [2024-11-13 13:16:57,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:16:57,773 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:16:57,774 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2024-11-13 13:16:57,789 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/data/2a92c0868/8a733c81007d47c6ad60c369d12c3c6b/FLAGca76f733d [2024-11-13 13:16:57,807 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/data/2a92c0868/8a733c81007d47c6ad60c369d12c3c6b [2024-11-13 13:16:57,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:16:57,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:16:57,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:16:57,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:16:57,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:16:57,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:16:57" (1/1) ... [2024-11-13 13:16:57,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30670a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:57, skipping insertion in model container [2024-11-13 13:16:57,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:16:57" (1/1) ... [2024-11-13 13:16:57,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:16:58,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:16:58,283 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:16:58,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:16:58,434 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:16:58,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58 WrapperNode [2024-11-13 13:16:58,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:16:58,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:16:58,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:16:58,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:16:58,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,490 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2024-11-13 13:16:58,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:16:58,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:16:58,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:16:58,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:16:58,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,526 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:16:58,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:16:58,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:16:58,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:16:58,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:16:58,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (1/1) ... [2024-11-13 13:16:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:16:58,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:16:58,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:16:58,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:16:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 13:16:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:16:58,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:16:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 13:16:58,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 13:16:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 13:16:58,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 13:16:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 13:16:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:16:58,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:16:58,659 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 13:16:58,882 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:16:58,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:16:59,324 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:16:59,324 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:16:59,649 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:16:59,650 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:16:59,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:16:59 BoogieIcfgContainer [2024-11-13 13:16:59,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:16:59,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:16:59,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:16:59,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:16:59,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:16:57" (1/3) ... [2024-11-13 13:16:59,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef82bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:16:59, skipping insertion in model container [2024-11-13 13:16:59,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:16:58" (2/3) ... [2024-11-13 13:16:59,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef82bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:16:59, skipping insertion in model container [2024-11-13 13:16:59,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:16:59" (3/3) ... [2024-11-13 13:16:59,664 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2024-11-13 13:16:59,681 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:16:59,684 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix031.oepc.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 13:16:59,684 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:16:59,767 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 13:16:59,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 86 flow [2024-11-13 13:16:59,866 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2024-11-13 13:16:59,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:16:59,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 2/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-13 13:16:59,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 86 flow [2024-11-13 13:16:59,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 37 transitions, 80 flow [2024-11-13 13:16:59,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:16:59,912 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@218f6dae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:16:59,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-13 13:16:59,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:16:59,921 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 13:16:59,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:16:59,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:59,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 13:16:59,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:16:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash 11193878, now seen corresponding path program 1 times [2024-11-13 13:16:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:16:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193889129] [2024-11-13 13:16:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:59,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:16:59,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:16:59,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:16:59,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:17:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:00,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:17:00,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:17:00,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:00,151 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:17:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193889129] [2024-11-13 13:17:00,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193889129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:17:00,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497066864] [2024-11-13 13:17:00,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:00,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:17:00,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:17:00,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:17:00,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:17:00,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-11-13 13:17:00,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:00,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:17:00,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-11-13 13:17:00,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:17:00,470 INFO L124 PetriNetUnfolderBase]: 183/411 cut-off events. [2024-11-13 13:17:00,471 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 13:17:00,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 411 events. 183/411 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2113 event pairs, 69 based on Foata normal form. 32/438 useless extension candidates. Maximal degree in co-relation 735. Up to 265 conditions per place. [2024-11-13 13:17:00,476 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 25 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2024-11-13 13:17:00,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 157 flow [2024-11-13 13:17:00,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:17:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:17:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-13 13:17:00,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2024-11-13 13:17:00,495 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 80 flow. Second operand 3 states and 88 transitions. [2024-11-13 13:17:00,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 157 flow [2024-11-13 13:17:00,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:17:00,507 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2024-11-13 13:17:00,510 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-11-13 13:17:00,515 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2024-11-13 13:17:00,517 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2024-11-13 13:17:00,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:00,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:17:00,517 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:00,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:17:00,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:00,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:17:00,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1097371514, now seen corresponding path program 1 times [2024-11-13 13:17:00,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:17:00,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794553277] [2024-11-13 13:17:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:00,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:00,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:00,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:00,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:17:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:00,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:17:00,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:17:00,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:00,860 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:17:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794553277] [2024-11-13 13:17:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794553277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:00,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:17:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025776727] [2024-11-13 13:17:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:17:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:17:00,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:17:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:17:00,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-11-13 13:17:00,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:00,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:17:00,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-11-13 13:17:00,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:17:01,020 INFO L124 PetriNetUnfolderBase]: 159/381 cut-off events. [2024-11-13 13:17:01,020 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-13 13:17:01,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 381 events. 159/381 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2108 event pairs, 159 based on Foata normal form. 16/380 useless extension candidates. Maximal degree in co-relation 695. Up to 280 conditions per place. [2024-11-13 13:17:01,026 INFO L140 encePairwiseOnDemand]: 37/39 looper letters, 14 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-11-13 13:17:01,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 102 flow [2024-11-13 13:17:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:17:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:17:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-13 13:17:01,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2024-11-13 13:17:01,030 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 3 states and 68 transitions. [2024-11-13 13:17:01,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 102 flow [2024-11-13 13:17:01,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:17:01,032 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 66 flow [2024-11-13 13:17:01,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-13 13:17:01,034 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-11-13 13:17:01,034 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 66 flow [2024-11-13 13:17:01,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:01,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:17:01,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:01,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:17:01,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:01,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:17:01,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1097372943, now seen corresponding path program 1 times [2024-11-13 13:17:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:17:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683873109] [2024-11-13 13:17:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:01,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:01,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:01,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:01,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:17:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:01,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:17:01,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:17:01,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:01,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:17:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683873109] [2024-11-13 13:17:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683873109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:17:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728148790] [2024-11-13 13:17:01,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:01,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:17:01,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:17:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:17:01,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:17:01,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-13 13:17:01,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:01,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:17:01,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-13 13:17:01,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:17:01,638 INFO L124 PetriNetUnfolderBase]: 198/444 cut-off events. [2024-11-13 13:17:01,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:17:01,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 444 events. 198/444 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2192 event pairs, 38 based on Foata normal form. 25/455 useless extension candidates. Maximal degree in co-relation 818. Up to 191 conditions per place. [2024-11-13 13:17:01,646 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 31 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2024-11-13 13:17:01,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 176 flow [2024-11-13 13:17:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:17:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:17:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-13 13:17:01,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2024-11-13 13:17:01,647 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 66 flow. Second operand 4 states and 98 transitions. [2024-11-13 13:17:01,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 176 flow [2024-11-13 13:17:01,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:17:01,652 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 91 flow [2024-11-13 13:17:01,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-11-13 13:17:01,653 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2024-11-13 13:17:01,653 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 91 flow [2024-11-13 13:17:01,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:01,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:17:01,654 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:01,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:17:01,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:01,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:17:01,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2002256625, now seen corresponding path program 1 times [2024-11-13 13:17:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:17:01,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310111613] [2024-11-13 13:17:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:01,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:01,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:01,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:17:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:01,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:17:01,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:17:02,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:02,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:17:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310111613] [2024-11-13 13:17:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310111613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:02,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:17:02,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581850858] [2024-11-13 13:17:02,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:02,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:17:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:17:02,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:17:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:17:02,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-13 13:17:02,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:02,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:17:02,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-13 13:17:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:17:02,225 INFO L124 PetriNetUnfolderBase]: 102/231 cut-off events. [2024-11-13 13:17:02,226 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-11-13 13:17:02,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 231 events. 102/231 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 804 event pairs, 26 based on Foata normal form. 16/236 useless extension candidates. Maximal degree in co-relation 520. Up to 86 conditions per place. [2024-11-13 13:17:02,229 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 26 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2024-11-13 13:17:02,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 188 flow [2024-11-13 13:17:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:17:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:17:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-11-13 13:17:02,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2024-11-13 13:17:02,234 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 91 flow. Second operand 5 states and 110 transitions. [2024-11-13 13:17:02,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 188 flow [2024-11-13 13:17:02,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 179 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 13:17:02,238 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 107 flow [2024-11-13 13:17:02,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2024-11-13 13:17:02,239 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-11-13 13:17:02,240 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 107 flow [2024-11-13 13:17:02,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:02,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:17:02,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:02,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:17:02,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:02,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:17:02,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash 82862628, now seen corresponding path program 1 times [2024-11-13 13:17:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:17:02,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180102407] [2024-11-13 13:17:02,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:02,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:02,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:02,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:02,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:17:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:02,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 13:17:02,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:17:03,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:03,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:17:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180102407] [2024-11-13 13:17:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180102407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:17:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913030142] [2024-11-13 13:17:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:03,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:17:03,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:17:03,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:17:03,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:17:03,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-11-13 13:17:03,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 107 flow. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:03,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:17:03,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-11-13 13:17:03,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:17:03,431 INFO L124 PetriNetUnfolderBase]: 99/253 cut-off events. [2024-11-13 13:17:03,431 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-11-13 13:17:03,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 253 events. 99/253 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 916 event pairs, 19 based on Foata normal form. 4/251 useless extension candidates. Maximal degree in co-relation 573. Up to 59 conditions per place. [2024-11-13 13:17:03,434 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 23 selfloop transitions, 4 changer transitions 20/62 dead transitions. [2024-11-13 13:17:03,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 275 flow [2024-11-13 13:17:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:17:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:17:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-11-13 13:17:03,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-13 13:17:03,436 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 107 flow. Second operand 10 states and 208 transitions. [2024-11-13 13:17:03,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 275 flow [2024-11-13 13:17:03,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 238 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-13 13:17:03,439 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 99 flow [2024-11-13 13:17:03,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=99, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2024-11-13 13:17:03,440 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2024-11-13 13:17:03,440 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 99 flow [2024-11-13 13:17:03,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:03,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:17:03,441 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:03,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:17:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:03,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:17:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1395609778, now seen corresponding path program 2 times [2024-11-13 13:17:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:17:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031094369] [2024-11-13 13:17:03,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:17:03,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:03,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:03,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:17:03,761 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:17:03,761 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:17:03,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:17:03,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:17:03,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:03,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:17:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031094369] [2024-11-13 13:17:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031094369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:03,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:17:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539199974] [2024-11-13 13:17:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:03,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:17:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:17:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:17:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:17:04,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-13 13:17:04,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 99 flow. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:04,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:17:04,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-13 13:17:04,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:17:04,405 INFO L124 PetriNetUnfolderBase]: 169/376 cut-off events. [2024-11-13 13:17:04,405 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-13 13:17:04,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 376 events. 169/376 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1420 event pairs, 43 based on Foata normal form. 4/377 useless extension candidates. Maximal degree in co-relation 860. Up to 145 conditions per place. [2024-11-13 13:17:04,407 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 26 selfloop transitions, 4 changer transitions 30/69 dead transitions. [2024-11-13 13:17:04,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 333 flow [2024-11-13 13:17:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:17:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 13:17:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-11-13 13:17:04,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-11-13 13:17:04,415 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 99 flow. Second operand 9 states and 169 transitions. [2024-11-13 13:17:04,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 333 flow [2024-11-13 13:17:04,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 297 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-13 13:17:04,418 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 104 flow [2024-11-13 13:17:04,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=104, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2024-11-13 13:17:04,420 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2024-11-13 13:17:04,421 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 104 flow [2024-11-13 13:17:04,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:17:04,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:17:04,421 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:04,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:17:04,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:04,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 13:17:04,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2017066950, now seen corresponding path program 3 times [2024-11-13 13:17:04,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:17:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579078642] [2024-11-13 13:17:04,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:17:04,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:04,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:04,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:04,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:17:04,729 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 13:17:04,729 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 13:17:04,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:17:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:17:04,814 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 13:17:04,815 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:17:04,816 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-13 13:17:04,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-13 13:17:04,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-13 13:17:04,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-13 13:17:04,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-13 13:17:04,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-13 13:17:04,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:17:05,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:05,020 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-13 13:17:05,123 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 13:17:05,125 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:17:05,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:17:05 BasicIcfg [2024-11-13 13:17:05,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:17:05,137 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:17:05,137 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:17:05,138 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:17:05,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:16:59" (3/4) ... [2024-11-13 13:17:05,142 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:17:05,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:17:05,144 INFO L158 Benchmark]: Toolchain (without parser) took 7331.27ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 64.4MB in the end (delta: 29.2MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-11-13 13:17:05,144 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:17:05,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.99ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 70.7MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:17:05,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.32ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:17:05,145 INFO L158 Benchmark]: Boogie Preprocessor took 71.66ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 65.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:17:05,145 INFO L158 Benchmark]: RCFGBuilder took 1087.50ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 58.2MB in the end (delta: 7.3MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-13 13:17:05,145 INFO L158 Benchmark]: TraceAbstraction took 5483.27ms. Allocated memory is still 117.4MB. Free memory was 57.5MB in the beginning and 64.4MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:17:05,146 INFO L158 Benchmark]: Witness Printer took 5.85ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 64.4MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:17:05,148 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.33ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.99ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 70.7MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.32ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.66ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 65.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1087.50ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 58.2MB in the end (delta: 7.3MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5483.27ms. Allocated memory is still 117.4MB. Free memory was 57.5MB in the beginning and 64.4MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.85ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 64.4MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L829] 0 pthread_t t834; [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833=0, t834=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] 2 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=0, t834=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=0, t834=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833=0, t834=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix031.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 6 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: 5.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 10 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=4, InterpolantAutomatonStates: 34, 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.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 15 NumberOfNonLiveVariables, 517 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 [2024-11-13 13:17:05,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc4d0b-d01a-4412-81a2-c65aad202ef7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample