./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:31:50,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:31:50,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:31:50,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:31:50,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:31:50,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:31:50,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:31:50,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:31:50,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:31:50,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:31:50,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:31:50,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:31:50,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:31:50,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:31:50,193 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:31:50,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:31:50,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:31:50,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:31:50,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:31:50,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:31:50,195 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:31:50,195 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:31:50,196 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:31:50,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:31:50,196 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:31:50,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:31:50,197 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:31:50,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:31:50,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:31:50,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:31:50,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:31:50,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:31:50,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:31:50,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:31:50,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:31:50,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:31:50,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:31:50,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:31:50,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:31:50,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:31:50,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:31:50,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:31:50,200 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2024-10-14 19:31:50,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:31:50,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:31:50,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:31:50,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:31:50,436 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:31:50,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:31:51,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:31:51,933 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:31:51,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:31:51,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a95ddb7a/a308479b3c1445f5ada5b9d7f3bfd0d1/FLAG2c3fcf24e [2024-10-14 19:31:52,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a95ddb7a/a308479b3c1445f5ada5b9d7f3bfd0d1 [2024-10-14 19:31:52,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:31:52,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:31:52,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:31:52,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:31:52,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:31:52,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a065ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52, skipping insertion in model container [2024-10-14 19:31:52,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:31:52,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:31:52,679 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:31:52,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:31:52,769 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:31:52,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52 WrapperNode [2024-10-14 19:31:52,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:31:52,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:31:52,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:31:52,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:31:52,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,829 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2024-10-14 19:31:52,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:31:52,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:31:52,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:31:52,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:31:52,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,868 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-10-14 19:31:52,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:31:52,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:31:52,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:31:52,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:31:52,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (1/1) ... [2024-10-14 19:31:52,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:31:52,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:31:52,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:31:52,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:31:52,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:31:52,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:31:52,972 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:31:52,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:31:52,973 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:31:52,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:31:52,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:31:52,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:31:52,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:31:52,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:31:52,975 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:31:53,080 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:31:53,082 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:31:53,336 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:31:53,337 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:31:53,468 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:31:53,469 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:31:53,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:31:53 BoogieIcfgContainer [2024-10-14 19:31:53,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:31:53,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:31:53,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:31:53,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:31:53,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:31:52" (1/3) ... [2024-10-14 19:31:53,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b52377d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:31:53, skipping insertion in model container [2024-10-14 19:31:53,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:52" (2/3) ... [2024-10-14 19:31:53,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b52377d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:31:53, skipping insertion in model container [2024-10-14 19:31:53,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:31:53" (3/3) ... [2024-10-14 19:31:53,479 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:31:53,494 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:31:53,494 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 19:31:53,494 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:31:53,534 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:31:53,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-10-14 19:31:53,585 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-10-14 19:31:53,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:31:53,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-10-14 19:31:53,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-10-14 19:31:53,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-10-14 19:31:53,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:31:53,604 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;@27ad4b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:31:53,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 19:31:53,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:31:53,607 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-10-14 19:31:53,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:31:53,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:53,608 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:31:53,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:31:53,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1812197485, now seen corresponding path program 1 times [2024-10-14 19:31:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:31:53,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632595449] [2024-10-14 19:31:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:54,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:31:54,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632595449] [2024-10-14 19:31:54,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632595449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:54,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:54,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:31:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611045624] [2024-10-14 19:31:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:54,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:31:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:31:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:31:54,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:31:54,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-10-14 19:31:54,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 19:31:54,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:54,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-10-14 19:31:54,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:54,308 INFO L124 PetriNetUnfolderBase]: 146/391 cut-off events. [2024-10-14 19:31:54,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:31:54,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 391 events. 146/391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2222 event pairs, 20 based on Foata normal form. 24/409 useless extension candidates. Maximal degree in co-relation 654. Up to 208 conditions per place. [2024-10-14 19:31:54,317 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 23 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-10-14 19:31:54,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 142 flow [2024-10-14 19:31:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:31:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:31:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-10-14 19:31:54,329 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7207207207207207 [2024-10-14 19:31:54,331 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 80 transitions. [2024-10-14 19:31:54,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 142 flow [2024-10-14 19:31:54,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:31:54,335 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-10-14 19:31:54,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-10-14 19:31:54,341 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-10-14 19:31:54,343 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-10-14 19:31:54,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 19:31:54,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:54,343 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:54,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:31:54,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:31:54,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1112992706, now seen corresponding path program 1 times [2024-10-14 19:31:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:31:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863074489] [2024-10-14 19:31:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:31:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863074489] [2024-10-14 19:31:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863074489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:54,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:54,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:31:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028473560] [2024-10-14 19:31:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:54,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:31:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:31:54,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:31:54,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:31:54,412 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-14 19:31:54,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-14 19:31:54,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:54,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-14 19:31:54,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:54,484 INFO L124 PetriNetUnfolderBase]: 129/299 cut-off events. [2024-10-14 19:31:54,485 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-14 19:31:54,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 299 events. 129/299 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1639 event pairs, 129 based on Foata normal form. 12/296 useless extension candidates. Maximal degree in co-relation 557. Up to 232 conditions per place. [2024-10-14 19:31:54,489 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-10-14 19:31:54,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 98 flow [2024-10-14 19:31:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:31:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:31:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-10-14 19:31:54,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2024-10-14 19:31:54,491 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 62 transitions. [2024-10-14 19:31:54,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 98 flow [2024-10-14 19:31:54,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:31:54,492 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2024-10-14 19:31:54,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-10-14 19:31:54,493 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-10-14 19:31:54,494 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2024-10-14 19:31:54,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-14 19:31:54,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:54,494 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:54,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:31:54,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:31:54,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1112991302, now seen corresponding path program 1 times [2024-10-14 19:31:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:31:54,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018695175] [2024-10-14 19:31:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:31:54,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018695175] [2024-10-14 19:31:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018695175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:31:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910190080] [2024-10-14 19:31:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:54,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:31:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:31:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:31:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:31:54,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-10-14 19:31:54,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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-10-14 19:31:54,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:54,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-10-14 19:31:54,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:55,013 INFO L124 PetriNetUnfolderBase]: 183/407 cut-off events. [2024-10-14 19:31:55,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:31:55,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 407 events. 183/407 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2246 event pairs, 45 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 744. Up to 151 conditions per place. [2024-10-14 19:31:55,017 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 19 selfloop transitions, 2 changer transitions 26/58 dead transitions. [2024-10-14 19:31:55,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 216 flow [2024-10-14 19:31:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:31:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:31:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-10-14 19:31:55,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.543918918918919 [2024-10-14 19:31:55,020 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 161 transitions. [2024-10-14 19:31:55,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 216 flow [2024-10-14 19:31:55,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:31:55,022 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 75 flow [2024-10-14 19:31:55,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=75, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2024-10-14 19:31:55,024 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-10-14 19:31:55,025 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 75 flow [2024-10-14 19:31:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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-10-14 19:31:55,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:55,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:31:55,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:31:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1597216247, now seen corresponding path program 1 times [2024-10-14 19:31:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:31:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815004243] [2024-10-14 19:31:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:55,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:31:55,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815004243] [2024-10-14 19:31:55,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815004243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:55,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:55,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:31:55,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496447134] [2024-10-14 19:31:55,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:55,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:31:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:31:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:31:55,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:31:55,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-10-14 19:31:55,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 75 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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-10-14 19:31:55,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:55,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-10-14 19:31:55,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:55,972 INFO L124 PetriNetUnfolderBase]: 155/387 cut-off events. [2024-10-14 19:31:55,972 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-10-14 19:31:55,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 387 events. 155/387 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1995 event pairs, 67 based on Foata normal form. 12/397 useless extension candidates. Maximal degree in co-relation 792. Up to 225 conditions per place. [2024-10-14 19:31:55,974 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 23 selfloop transitions, 5 changer transitions 17/56 dead transitions. [2024-10-14 19:31:55,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 235 flow [2024-10-14 19:31:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:31:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:31:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-10-14 19:31:55,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371621621621622 [2024-10-14 19:31:55,977 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 75 flow. Second operand 8 states and 159 transitions. [2024-10-14 19:31:55,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 235 flow [2024-10-14 19:31:55,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 215 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-14 19:31:55,983 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 107 flow [2024-10-14 19:31:55,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2024-10-14 19:31:55,985 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-10-14 19:31:55,985 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 107 flow [2024-10-14 19:31:55,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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-10-14 19:31:55,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:55,986 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:55,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:31:55,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:31:55,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1415553566, now seen corresponding path program 1 times [2024-10-14 19:31:55,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:31:55,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033493463] [2024-10-14 19:31:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:55,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:31:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033493463] [2024-10-14 19:31:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033493463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:56,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:31:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172972594] [2024-10-14 19:31:56,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:56,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:31:56,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:31:56,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:31:56,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:31:56,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-10-14 19:31:56,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-10-14 19:31:56,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:56,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-10-14 19:31:56,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:56,254 INFO L124 PetriNetUnfolderBase]: 185/398 cut-off events. [2024-10-14 19:31:56,255 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-10-14 19:31:56,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 398 events. 185/398 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1738 event pairs, 28 based on Foata normal form. 24/407 useless extension candidates. Maximal degree in co-relation 954. Up to 202 conditions per place. [2024-10-14 19:31:56,258 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 32 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-10-14 19:31:56,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 229 flow [2024-10-14 19:31:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:31:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:31:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-10-14 19:31:56,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2024-10-14 19:31:56,261 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 107 flow. Second operand 4 states and 88 transitions. [2024-10-14 19:31:56,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 229 flow [2024-10-14 19:31:56,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 225 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-14 19:31:56,264 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 133 flow [2024-10-14 19:31:56,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=133, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2024-10-14 19:31:56,265 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-10-14 19:31:56,266 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 133 flow [2024-10-14 19:31:56,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-10-14 19:31:56,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:56,267 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-10-14 19:31:56,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:31:56,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:31:56,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1442058990, now seen corresponding path program 1 times [2024-10-14 19:31:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:31:56,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130016177] [2024-10-14 19:31:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:56,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:31:56,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130016177] [2024-10-14 19:31:56,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130016177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:56,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:31:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491675261] [2024-10-14 19:31:56,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:56,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:31:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:31:56,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:31:56,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:31:56,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-10-14 19:31:56,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-10-14 19:31:56,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:56,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-10-14 19:31:56,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:56,562 INFO L124 PetriNetUnfolderBase]: 114/257 cut-off events. [2024-10-14 19:31:56,562 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-10-14 19:31:56,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 257 events. 114/257 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 955 event pairs, 28 based on Foata normal form. 16/257 useless extension candidates. Maximal degree in co-relation 694. Up to 98 conditions per place. [2024-10-14 19:31:56,565 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 29 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2024-10-14 19:31:56,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 240 flow [2024-10-14 19:31:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:31:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:31:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-10-14 19:31:56,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-10-14 19:31:56,567 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 133 flow. Second operand 5 states and 100 transitions. [2024-10-14 19:31:56,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 240 flow [2024-10-14 19:31:56,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 219 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-10-14 19:31:56,570 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 146 flow [2024-10-14 19:31:56,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=146, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2024-10-14 19:31:56,570 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-10-14 19:31:56,570 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 146 flow [2024-10-14 19:31:56,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-10-14 19:31:56,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:56,571 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] [2024-10-14 19:31:56,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:31:56,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:31:56,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 50093053, now seen corresponding path program 1 times [2024-10-14 19:31:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:31:56,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815940274] [2024-10-14 19:31:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:56,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:31:57,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815940274] [2024-10-14 19:31:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815940274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:57,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:57,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:31:57,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610566268] [2024-10-14 19:31:57,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:57,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:31:57,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:31:57,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:31:57,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:31:57,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-10-14 19:31:57,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 146 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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-10-14 19:31:57,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:57,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-10-14 19:31:57,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:57,294 INFO L124 PetriNetUnfolderBase]: 148/381 cut-off events. [2024-10-14 19:31:57,294 INFO L125 PetriNetUnfolderBase]: For 290/322 co-relation queries the response was YES. [2024-10-14 19:31:57,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 381 events. 148/381 cut-off events. For 290/322 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1754 event pairs, 42 based on Foata normal form. 10/369 useless extension candidates. Maximal degree in co-relation 946. Up to 157 conditions per place. [2024-10-14 19:31:57,297 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 20 selfloop transitions, 3 changer transitions 27/64 dead transitions. [2024-10-14 19:31:57,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 328 flow [2024-10-14 19:31:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:31:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:31:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-10-14 19:31:57,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2024-10-14 19:31:57,299 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 146 flow. Second operand 8 states and 143 transitions. [2024-10-14 19:31:57,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 328 flow [2024-10-14 19:31:57,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-14 19:31:57,302 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 145 flow [2024-10-14 19:31:57,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-10-14 19:31:57,303 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-10-14 19:31:57,303 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 145 flow [2024-10-14 19:31:57,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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-10-14 19:31:57,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:57,304 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] [2024-10-14 19:31:57,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:31:57,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:31:57,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash -140345323, now seen corresponding path program 2 times [2024-10-14 19:31:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:31:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373352992] [2024-10-14 19:31:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:31:57,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:31:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:31:57,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:31:57,427 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:31:57,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-10-14 19:31:57,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-14 19:31:57,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-14 19:31:57,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-14 19:31:57,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-14 19:31:57,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-14 19:31:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:31:57,430 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:57,488 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:31:57,488 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:31:57,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:31:57 BasicIcfg [2024-10-14 19:31:57,492 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:31:57,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:31:57,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:31:57,493 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:31:57,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:31:53" (3/4) ... [2024-10-14 19:31:57,495 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:31:57,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:31:57,498 INFO L158 Benchmark]: Toolchain (without parser) took 5212.14ms. Allocated memory was 142.6MB in the beginning and 237.0MB in the end (delta: 94.4MB). Free memory was 69.5MB in the beginning and 97.7MB in the end (delta: -28.2MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-10-14 19:31:57,498 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:31:57,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.19ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 69.4MB in the beginning and 141.6MB in the end (delta: -72.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-10-14 19:31:57,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.62ms. Allocated memory is still 184.5MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:31:57,500 INFO L158 Benchmark]: Boogie Preprocessor took 54.41ms. Allocated memory is still 184.5MB. Free memory was 139.5MB in the beginning and 135.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:31:57,500 INFO L158 Benchmark]: RCFGBuilder took 584.14ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 88.2MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-14 19:31:57,500 INFO L158 Benchmark]: TraceAbstraction took 4020.33ms. Allocated memory was 184.5MB in the beginning and 237.0MB in the end (delta: 52.4MB). Free memory was 87.1MB in the beginning and 97.7MB in the end (delta: -10.6MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-10-14 19:31:57,501 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 237.0MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:31:57,502 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.17ms. Allocated memory is still 142.6MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.19ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 69.4MB in the beginning and 141.6MB in the end (delta: -72.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.62ms. Allocated memory is still 184.5MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.41ms. Allocated memory is still 184.5MB. Free memory was 139.5MB in the beginning and 135.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 584.14ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 88.2MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4020.33ms. Allocated memory was 184.5MB in the beginning and 237.0MB in the end (delta: 52.4MB). Free memory was 87.1MB in the beginning and 97.7MB in the end (delta: -10.6MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 237.0MB. Free memory is still 97.7MB. 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_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L740] 1 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L743] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 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: 3.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 494 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 6 mSDtfsCounter, 494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=6, InterpolantAutomatonStates: 39, 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.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 19:31:57,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:31:59,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:31:59,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:31:59,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:31:59,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:31:59,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:31:59,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:31:59,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:31:59,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:31:59,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:31:59,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:31:59,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:31:59,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:31:59,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:31:59,595 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:31:59,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:31:59,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:31:59,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:31:59,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:31:59,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:31:59,596 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:31:59,597 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:31:59,597 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:31:59,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:31:59,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:31:59,600 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:31:59,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:31:59,600 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:31:59,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:31:59,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:31:59,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:31:59,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:31:59,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:31:59,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:31:59,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:31:59,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:31:59,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:31:59,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:31:59,609 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:31:59,609 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:31:59,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:31:59,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:31:59,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:31:59,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:31:59,610 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:31:59,610 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2024-10-14 19:31:59,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:31:59,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:31:59,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:31:59,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:31:59,918 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:31:59,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:32:01,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:32:01,499 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:32:01,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:32:01,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cf3ceb2/670c48a9ce17409f96e9c79f39d7a9da/FLAG048a22522 [2024-10-14 19:32:01,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cf3ceb2/670c48a9ce17409f96e9c79f39d7a9da [2024-10-14 19:32:01,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:32:01,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:32:01,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:32:01,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:32:01,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:32:01,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:32:01" (1/1) ... [2024-10-14 19:32:01,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34007197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:01, skipping insertion in model container [2024-10-14 19:32:01,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:32:01" (1/1) ... [2024-10-14 19:32:01,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:32:02,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:32:02,253 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:32:02,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:32:02,344 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:32:02,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02 WrapperNode [2024-10-14 19:32:02,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:32:02,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:32:02,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:32:02,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:32:02,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,405 INFO L138 Inliner]: procedures = 175, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2024-10-14 19:32:02,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:32:02,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:32:02,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:32:02,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:32:02,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,435 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-10-14 19:32:02,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:32:02,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:32:02,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:32:02,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:32:02,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (1/1) ... [2024-10-14 19:32:02,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:32:02,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:32:02,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:32:02,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:32:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:32:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:32:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:32:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:32:02,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:32:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:32:02,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:32:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:32:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:32:02,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:32:02,548 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:32:02,689 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:32:02,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:32:02,969 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:32:02,970 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:32:03,142 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:32:03,142 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:32:03,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:32:03 BoogieIcfgContainer [2024-10-14 19:32:03,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:32:03,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:32:03,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:32:03,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:32:03,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:32:01" (1/3) ... [2024-10-14 19:32:03,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4897e9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:32:03, skipping insertion in model container [2024-10-14 19:32:03,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:02" (2/3) ... [2024-10-14 19:32:03,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4897e9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:32:03, skipping insertion in model container [2024-10-14 19:32:03,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:32:03" (3/3) ... [2024-10-14 19:32:03,148 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-14 19:32:03,161 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:32:03,161 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 19:32:03,161 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:32:03,209 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:32:03,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-10-14 19:32:03,267 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-10-14 19:32:03,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:32:03,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-10-14 19:32:03,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-10-14 19:32:03,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-10-14 19:32:03,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:32:03,291 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;@46eea95c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:32:03,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 19:32:03,297 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:32:03,297 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-10-14 19:32:03,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:32:03,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:32:03,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:32:03,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:32:03,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:32:03,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1871364397, now seen corresponding path program 1 times [2024-10-14 19:32:03,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:32:03,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047455942] [2024-10-14 19:32:03,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:32:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:32:03,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:32:03,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:32:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:32:03,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:32:03,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:32:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:32:03,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:32:03,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:32:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047455942] [2024-10-14 19:32:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047455942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:32:03,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:32:03,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:32:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188207151] [2024-10-14 19:32:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:32:03,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:32:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:32:03,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:32:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:32:03,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-10-14 19:32:03,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 19:32:03,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:32:03,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-10-14 19:32:03,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:32:03,680 INFO L124 PetriNetUnfolderBase]: 146/391 cut-off events. [2024-10-14 19:32:03,681 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:32:03,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 391 events. 146/391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2222 event pairs, 20 based on Foata normal form. 24/409 useless extension candidates. Maximal degree in co-relation 654. Up to 208 conditions per place. [2024-10-14 19:32:03,687 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 23 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-10-14 19:32:03,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 142 flow [2024-10-14 19:32:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:32:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:32:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-10-14 19:32:03,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7207207207207207 [2024-10-14 19:32:03,700 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 80 transitions. [2024-10-14 19:32:03,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 142 flow [2024-10-14 19:32:03,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:32:03,706 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-10-14 19:32:03,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-10-14 19:32:03,713 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-10-14 19:32:03,713 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-10-14 19:32:03,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 19:32:03,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:32:03,713 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:32:03,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:32:03,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:03,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:32:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:32:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 571290304, now seen corresponding path program 1 times [2024-10-14 19:32:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:32:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652600466] [2024-10-14 19:32:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:32:03,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:03,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:32:03,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:32:03,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:32:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:32:04,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:32:04,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:32:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:32:04,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:32:04,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:32:04,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652600466] [2024-10-14 19:32:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652600466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:32:04,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:32:04,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:32:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874232330] [2024-10-14 19:32:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:32:04,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:32:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:32:04,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:32:04,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:32:04,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-10-14 19:32:04,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-10-14 19:32:04,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:32:04,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-10-14 19:32:04,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:32:04,220 INFO L124 PetriNetUnfolderBase]: 199/433 cut-off events. [2024-10-14 19:32:04,221 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-14 19:32:04,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 433 events. 199/433 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2187 event pairs, 24 based on Foata normal form. 20/441 useless extension candidates. Maximal degree in co-relation 829. Up to 232 conditions per place. [2024-10-14 19:32:04,224 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 30 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-10-14 19:32:04,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 176 flow [2024-10-14 19:32:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:32:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:32:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-10-14 19:32:04,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-10-14 19:32:04,227 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 4 states and 89 transitions. [2024-10-14 19:32:04,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 176 flow [2024-10-14 19:32:04,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:32:04,229 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 90 flow [2024-10-14 19:32:04,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=90, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-10-14 19:32:04,230 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-10-14 19:32:04,232 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 90 flow [2024-10-14 19:32:04,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-10-14 19:32:04,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:32:04,233 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:32:04,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 19:32:04,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:04,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:32:04,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:32:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1752609003, now seen corresponding path program 1 times [2024-10-14 19:32:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:32:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634321750] [2024-10-14 19:32:04,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:32:04,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:04,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:32:04,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:32:04,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:32:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:32:04,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:32:04,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:32:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:32:04,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:32:04,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:32:04,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634321750] [2024-10-14 19:32:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634321750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:32:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:32:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:32:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407175895] [2024-10-14 19:32:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:32:04,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:32:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:32:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:32:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:32:04,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-10-14 19:32:04,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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-10-14 19:32:04,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:32:04,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-10-14 19:32:04,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:32:04,679 INFO L124 PetriNetUnfolderBase]: 92/210 cut-off events. [2024-10-14 19:32:04,680 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-10-14 19:32:04,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 210 events. 92/210 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 720 event pairs, 16 based on Foata normal form. 14/214 useless extension candidates. Maximal degree in co-relation 469. Up to 71 conditions per place. [2024-10-14 19:32:04,681 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2024-10-14 19:32:04,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 185 flow [2024-10-14 19:32:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:32:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:32:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-10-14 19:32:04,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-10-14 19:32:04,685 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 90 flow. Second operand 5 states and 100 transitions. [2024-10-14 19:32:04,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 185 flow [2024-10-14 19:32:04,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 19:32:04,687 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 106 flow [2024-10-14 19:32:04,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=106, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-10-14 19:32:04,690 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-10-14 19:32:04,690 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 106 flow [2024-10-14 19:32:04,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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-10-14 19:32:04,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:32:04,691 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] [2024-10-14 19:32:04,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:32:04,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:04,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:32:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:32:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash -234171517, now seen corresponding path program 1 times [2024-10-14 19:32:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:32:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111780396] [2024-10-14 19:32:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:32:04,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:04,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:32:04,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:32:04,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:32:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:32:04,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:32:04,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:32:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:32:05,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:32:05,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:32:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111780396] [2024-10-14 19:32:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111780396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:32:05,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:32:05,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:32:05,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338172878] [2024-10-14 19:32:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:32:05,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:32:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:32:05,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:32:05,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:32:05,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-14 19:32:05,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-10-14 19:32:05,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:32:05,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-14 19:32:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:32:05,062 INFO L124 PetriNetUnfolderBase]: 53/146 cut-off events. [2024-10-14 19:32:05,062 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-14 19:32:05,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 146 events. 53/146 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 469 event pairs, 52 based on Foata normal form. 4/137 useless extension candidates. Maximal degree in co-relation 295. Up to 109 conditions per place. [2024-10-14 19:32:05,064 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-10-14 19:32:05,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 136 flow [2024-10-14 19:32:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:32:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:32:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-10-14 19:32:05,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2024-10-14 19:32:05,066 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 106 flow. Second operand 3 states and 62 transitions. [2024-10-14 19:32:05,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 136 flow [2024-10-14 19:32:05,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 108 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-14 19:32:05,067 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 76 flow [2024-10-14 19:32:05,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=76, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-10-14 19:32:05,068 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-10-14 19:32:05,068 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 76 flow [2024-10-14 19:32:05,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-10-14 19:32:05,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:32:05,070 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] [2024-10-14 19:32:05,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 19:32:05,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:05,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:32:05,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:32:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash -234170113, now seen corresponding path program 1 times [2024-10-14 19:32:05,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:32:05,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384295832] [2024-10-14 19:32:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:32:05,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:32:05,273 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:32:05,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:32:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:32:05,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:32:05,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:32:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:32:05,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:32:05,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:32:05,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384295832] [2024-10-14 19:32:05,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384295832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:32:05,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:32:05,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:32:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151770145] [2024-10-14 19:32:05,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:32:05,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:32:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:32:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:32:05,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:32:05,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-10-14 19:32:05,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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-10-14 19:32:05,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:32:05,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-10-14 19:32:05,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:32:05,837 INFO L124 PetriNetUnfolderBase]: 108/272 cut-off events. [2024-10-14 19:32:05,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:32:05,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 272 events. 108/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1082 event pairs, 30 based on Foata normal form. 4/268 useless extension candidates. Maximal degree in co-relation 517. Up to 118 conditions per place. [2024-10-14 19:32:05,838 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 19 selfloop transitions, 1 changer transitions 17/50 dead transitions. [2024-10-14 19:32:05,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 192 flow [2024-10-14 19:32:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:32:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:32:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-10-14 19:32:05,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5495495495495496 [2024-10-14 19:32:05,840 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 76 flow. Second operand 6 states and 122 transitions. [2024-10-14 19:32:05,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 192 flow [2024-10-14 19:32:05,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:32:05,841 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 86 flow [2024-10-14 19:32:05,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2024-10-14 19:32:05,841 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-10-14 19:32:05,841 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 86 flow [2024-10-14 19:32:05,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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-10-14 19:32:05,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:32:05,842 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] [2024-10-14 19:32:05,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:32:06,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:06,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:32:06,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:32:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -192868403, now seen corresponding path program 2 times [2024-10-14 19:32:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:32:06,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583112726] [2024-10-14 19:32:06,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:32:06,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:06,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:32:06,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:32:06,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:32:06,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 19:32:06,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:32:06,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 19:32:06,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:32:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:32:06,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:32:06,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:32:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583112726] [2024-10-14 19:32:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583112726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:32:06,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:32:06,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 19:32:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214471211] [2024-10-14 19:32:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:32:06,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:32:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:32:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:32:06,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:32:06,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-10-14 19:32:06,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 86 flow. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 0 states have call successors, (0), 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-10-14 19:32:06,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:32:06,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-10-14 19:32:06,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:32:06,555 INFO L124 PetriNetUnfolderBase]: 93/251 cut-off events. [2024-10-14 19:32:06,555 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 19:32:06,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 251 events. 93/251 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 972 event pairs, 29 based on Foata normal form. 4/244 useless extension candidates. Maximal degree in co-relation 491. Up to 80 conditions per place. [2024-10-14 19:32:06,556 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 16 selfloop transitions, 3 changer transitions 16/49 dead transitions. [2024-10-14 19:32:06,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 200 flow [2024-10-14 19:32:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:32:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:32:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-10-14 19:32:06,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5444015444015444 [2024-10-14 19:32:06,557 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 86 flow. Second operand 7 states and 141 transitions. [2024-10-14 19:32:06,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 200 flow [2024-10-14 19:32:06,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 189 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 19:32:06,559 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 96 flow [2024-10-14 19:32:06,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2024-10-14 19:32:06,559 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-10-14 19:32:06,560 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 96 flow [2024-10-14 19:32:06,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 0 states have call successors, (0), 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-10-14 19:32:06,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:32:06,560 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] [2024-10-14 19:32:06,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 19:32:06,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:06,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-14 19:32:06,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:32:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -114425661, now seen corresponding path program 3 times [2024-10-14 19:32:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:32:06,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548611190] [2024-10-14 19:32:06,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:32:06,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:32:06,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:32:06,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:32:06,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-14 19:32:06,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 19:32:06,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:32:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:32:06,889 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 19:32:06,889 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:32:06,891 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-10-14 19:32:06,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-14 19:32:06,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-14 19:32:06,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-14 19:32:06,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-14 19:32:06,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-14 19:32:06,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 19:32:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:32:07,094 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-10-14 19:32:07,162 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:32:07,162 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:32:07,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:32:07 BasicIcfg [2024-10-14 19:32:07,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:32:07,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:32:07,172 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:32:07,172 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:32:07,172 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:32:03" (3/4) ... [2024-10-14 19:32:07,174 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:32:07,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:32:07,176 INFO L158 Benchmark]: Toolchain (without parser) took 5317.28ms. Allocated memory was 62.9MB in the beginning and 142.6MB in the end (delta: 79.7MB). Free memory was 25.5MB in the beginning and 113.9MB in the end (delta: -88.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:32:07,176 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory was 37.8MB in the beginning and 37.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:32:07,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.35ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 25.3MB in the beginning and 54.8MB in the end (delta: -29.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-14 19:32:07,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.95ms. Allocated memory is still 79.7MB. Free memory was 54.8MB in the beginning and 52.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:32:07,177 INFO L158 Benchmark]: Boogie Preprocessor took 48.02ms. Allocated memory is still 79.7MB. Free memory was 52.1MB in the beginning and 48.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:32:07,178 INFO L158 Benchmark]: RCFGBuilder took 687.05ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 34.1MB in the end (delta: 14.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-10-14 19:32:07,178 INFO L158 Benchmark]: TraceAbstraction took 4027.77ms. Allocated memory was 79.7MB in the beginning and 142.6MB in the end (delta: 62.9MB). Free memory was 33.2MB in the beginning and 115.0MB in the end (delta: -81.8MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2024-10-14 19:32:07,179 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 113.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:32:07,182 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.14ms. Allocated memory is still 62.9MB. Free memory was 37.8MB in the beginning and 37.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.35ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 25.3MB in the beginning and 54.8MB in the end (delta: -29.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.95ms. Allocated memory is still 79.7MB. Free memory was 54.8MB in the beginning and 52.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.02ms. Allocated memory is still 79.7MB. Free memory was 52.1MB in the beginning and 48.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 687.05ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 34.1MB in the end (delta: 14.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4027.77ms. Allocated memory was 79.7MB in the beginning and 142.6MB in the end (delta: 62.9MB). Free memory was 33.2MB in the beginning and 115.0MB in the end (delta: -81.8MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 113.9MB in the end (delta: 1.0MB). 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_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L740] 1 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L743] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 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: 3.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 4 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=3, InterpolantAutomatonStates: 28, 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.8s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 489 SizeOfPredicates, 8 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 36 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-10-14 19:32:07,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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