./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/safe000_power.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 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:09:21,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:09:21,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:09:21,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:09:21,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:09:21,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:09:21,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:09:21,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:09:21,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:09:21,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:09:21,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:09:21,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:09:21,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:09:21,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:09:21,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:09:21,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:09:21,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:09:21,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:09:21,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:09:21,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:09:21,463 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:09:21,467 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:09:21,467 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:09:21,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:09:21,468 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:09:21,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:09:21,468 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:09:21,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:09:21,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:09:21,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:09:21,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:09:21,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:09:21,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:09:21,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:09:21,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:09:21,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:09:21,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:09:21,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:09:21,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:09:21,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:09:21,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:09:21,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:09:21,472 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2024-11-12 16:09:21,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:09:21,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:09:21,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:09:21,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:09:21,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:09:21,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2024-11-12 16:09:23,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:09:23,488 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:09:23,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2024-11-12 16:09:23,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b9f172e/7685a54733cb48cca54250399914e295/FLAG4735dc84f [2024-11-12 16:09:23,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b9f172e/7685a54733cb48cca54250399914e295 [2024-11-12 16:09:23,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:09:23,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:09:23,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:09:23,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:09:23,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:09:23,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:09:23" (1/1) ... [2024-11-12 16:09:23,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75050ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:23, skipping insertion in model container [2024-11-12 16:09:23,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:09:23" (1/1) ... [2024-11-12 16:09:23,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:09:24,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:09:24,291 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:09:24,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:09:24,397 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:09:24,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24 WrapperNode [2024-11-12 16:09:24,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:09:24,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:09:24,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:09:24,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:09:24,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,463 INFO L138 Inliner]: procedures = 175, calls = 62, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2024-11-12 16:09:24,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:09:24,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:09:24,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:09:24,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:09:24,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,512 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-11-12 16:09:24,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:09:24,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:09:24,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:09:24,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:09:24,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (1/1) ... [2024-11-12 16:09:24,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:09:24,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:09:24,579 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-11-12 16:09:24,584 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-11-12 16:09:24,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 16:09:24,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 16:09:24,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 16:09:24,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 16:09:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 16:09:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:09:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-12 16:09:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-12 16:09:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-12 16:09:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-12 16:09:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-12 16:09:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-12 16:09:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:09:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 16:09:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 16:09:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:09:24,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:09:24,643 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:09:24,823 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:09:24,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:09:25,355 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:09:25,355 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:09:25,884 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:09:25,884 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 16:09:25,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:09:25 BoogieIcfgContainer [2024-11-12 16:09:25,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:09:25,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:09:25,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:09:25,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:09:25,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:09:23" (1/3) ... [2024-11-12 16:09:25,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8a940a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:09:25, skipping insertion in model container [2024-11-12 16:09:25,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:24" (2/3) ... [2024-11-12 16:09:25,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8a940a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:09:25, skipping insertion in model container [2024-11-12 16:09:25,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:09:25" (3/3) ... [2024-11-12 16:09:25,895 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2024-11-12 16:09:25,914 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:09:25,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-12 16:09:25,914 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:09:26,059 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 16:09:26,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 78 transitions, 168 flow [2024-11-12 16:09:26,176 INFO L124 PetriNetUnfolderBase]: 2/75 cut-off events. [2024-11-12 16:09:26,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:09:26,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 75 events. 2/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 293 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2024-11-12 16:09:26,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 78 transitions, 168 flow [2024-11-12 16:09:26,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 75 transitions, 159 flow [2024-11-12 16:09:26,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:09:26,215 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;@7e04312e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:09:26,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-11-12 16:09:26,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:09:26,224 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-12 16:09:26,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:09:26,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:26,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 16:09:26,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:26,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash 839398171, now seen corresponding path program 1 times [2024-11-12 16:09:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:26,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042082618] [2024-11-12 16:09:26,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042082618] [2024-11-12 16:09:26,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042082618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:26,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:26,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:09:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172791607] [2024-11-12 16:09:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:26,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:09:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:26,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:09:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:09:26,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:09:26,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:26,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:26,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:09:26,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:32,228 INFO L124 PetriNetUnfolderBase]: 21849/31893 cut-off events. [2024-11-12 16:09:32,229 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-12 16:09:32,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62502 conditions, 31893 events. 21849/31893 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 3500. Compared 278273 event pairs, 1794 based on Foata normal form. 1120/15404 useless extension candidates. Maximal degree in co-relation 62491. Up to 27560 conditions per place. [2024-11-12 16:09:32,556 INFO L140 encePairwiseOnDemand]: 59/78 looper letters, 73 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-11-12 16:09:32,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 345 flow [2024-11-12 16:09:32,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:09:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:09:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-11-12 16:09:32,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-11-12 16:09:32,572 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 159 flow. Second operand 3 states and 162 transitions. [2024-11-12 16:09:32,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 345 flow [2024-11-12 16:09:32,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 340 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:09:32,587 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2024-11-12 16:09:32,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-12 16:09:32,594 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2024-11-12 16:09:32,594 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2024-11-12 16:09:32,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:32,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:32,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:09:32,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:09:32,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:32,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash 250602757, now seen corresponding path program 1 times [2024-11-12 16:09:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:32,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838796242] [2024-11-12 16:09:32,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:32,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838796242] [2024-11-12 16:09:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838796242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:32,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:32,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:09:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258739541] [2024-11-12 16:09:32,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:32,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:09:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:32,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:09:32,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:09:32,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:09:32,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 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-11-12 16:09:32,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:32,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:09:32,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:34,447 INFO L124 PetriNetUnfolderBase]: 6742/10734 cut-off events. [2024-11-12 16:09:34,447 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2024-11-12 16:09:34,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20876 conditions, 10734 events. 6742/10734 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 85478 event pairs, 6742 based on Foata normal form. 0/6507 useless extension candidates. Maximal degree in co-relation 20866. Up to 9569 conditions per place. [2024-11-12 16:09:34,525 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 32 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2024-11-12 16:09:34,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 172 flow [2024-11-12 16:09:34,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:09:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:09:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-12 16:09:34,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-11-12 16:09:34,528 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 3 states and 96 transitions. [2024-11-12 16:09:34,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 172 flow [2024-11-12 16:09:34,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:09:34,531 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 104 flow [2024-11-12 16:09:34,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-11-12 16:09:34,532 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2024-11-12 16:09:34,532 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 104 flow [2024-11-12 16:09:34,532 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-11-12 16:09:34,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:34,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:09:34,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:09:34,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:34,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash 250602758, now seen corresponding path program 1 times [2024-11-12 16:09:34,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:34,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497960082] [2024-11-12 16:09:34,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:34,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:34,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:34,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497960082] [2024-11-12 16:09:34,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497960082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:34,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:34,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:09:34,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050198367] [2024-11-12 16:09:34,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:34,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:09:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:09:34,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:09:34,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:09:34,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 104 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-11-12 16:09:34,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:34,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:09:34,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:35,081 INFO L124 PetriNetUnfolderBase]: 1151/2022 cut-off events. [2024-11-12 16:09:35,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:09:35,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3788 conditions, 2022 events. 1151/2022 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13373 event pairs, 1151 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 3782. Up to 1720 conditions per place. [2024-11-12 16:09:35,093 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-12 16:09:35,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 134 flow [2024-11-12 16:09:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:09:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:09:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-12 16:09:35,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2024-11-12 16:09:35,095 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 104 flow. Second operand 3 states and 87 transitions. [2024-11-12 16:09:35,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 134 flow [2024-11-12 16:09:35,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:09:35,096 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-12 16:09:35,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-12 16:09:35,098 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -34 predicate places. [2024-11-12 16:09:35,099 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-12 16:09:35,099 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-11-12 16:09:35,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:35,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:09:35,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:35,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1412301609, now seen corresponding path program 1 times [2024-11-12 16:09:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827289989] [2024-11-12 16:09:35,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:35,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:35,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827289989] [2024-11-12 16:09:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827289989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:09:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648809258] [2024-11-12 16:09:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:35,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:09:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:09:35,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:09:35,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:09:35,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:35,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:35,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:09:35,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:35,526 INFO L124 PetriNetUnfolderBase]: 989/1773 cut-off events. [2024-11-12 16:09:35,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:09:35,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 1773 events. 989/1773 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11565 event pairs, 185 based on Foata normal form. 0/1683 useless extension candidates. Maximal degree in co-relation 3299. Up to 1237 conditions per place. [2024-11-12 16:09:35,536 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 35 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-12 16:09:35,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 189 flow [2024-11-12 16:09:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:09:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:09:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-12 16:09:35,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2024-11-12 16:09:35,538 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 93 transitions. [2024-11-12 16:09:35,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 189 flow [2024-11-12 16:09:35,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:09:35,540 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-12 16:09:35,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-12 16:09:35,541 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2024-11-12 16:09:35,542 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-12 16:09:35,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:35,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:35,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:35,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:09:35,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:35,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash -912569264, now seen corresponding path program 1 times [2024-11-12 16:09:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:35,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678738274] [2024-11-12 16:09:35,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:35,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678738274] [2024-11-12 16:09:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678738274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:09:35,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361793586] [2024-11-12 16:09:35,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:35,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:09:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:35,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:09:35,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:09:35,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:09:35,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:35,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:35,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:09:35,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:36,010 INFO L124 PetriNetUnfolderBase]: 914/1662 cut-off events. [2024-11-12 16:09:36,010 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-12 16:09:36,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3330 conditions, 1662 events. 914/1662 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10761 event pairs, 161 based on Foata normal form. 0/1644 useless extension candidates. Maximal degree in co-relation 3321. Up to 1125 conditions per place. [2024-11-12 16:09:36,018 INFO L140 encePairwiseOnDemand]: 75/78 looper letters, 34 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-12 16:09:36,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 192 flow [2024-11-12 16:09:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:09:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:09:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-12 16:09:36,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34935897435897434 [2024-11-12 16:09:36,021 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 109 transitions. [2024-11-12 16:09:36,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 192 flow [2024-11-12 16:09:36,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:09:36,024 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-12 16:09:36,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-12 16:09:36,026 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2024-11-12 16:09:36,026 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-12 16:09:36,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:36,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:36,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:36,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:09:36,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash -12128729, now seen corresponding path program 1 times [2024-11-12 16:09:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537665207] [2024-11-12 16:09:36,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:36,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:36,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537665207] [2024-11-12 16:09:36,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537665207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:36,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:36,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:09:36,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718810910] [2024-11-12 16:09:36,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:36,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:09:36,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:36,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:09:36,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:09:36,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:09:36,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:36,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:36,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:09:36,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:36,760 INFO L124 PetriNetUnfolderBase]: 839/1551 cut-off events. [2024-11-12 16:09:36,761 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-12 16:09:36,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3072 conditions, 1551 events. 839/1551 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9973 event pairs, 137 based on Foata normal form. 36/1569 useless extension candidates. Maximal degree in co-relation 3063. Up to 1014 conditions per place. [2024-11-12 16:09:36,770 INFO L140 encePairwiseOnDemand]: 75/78 looper letters, 33 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-12 16:09:36,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 186 flow [2024-11-12 16:09:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:09:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:09:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-12 16:09:36,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2024-11-12 16:09:36,773 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 108 transitions. [2024-11-12 16:09:36,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 186 flow [2024-11-12 16:09:36,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 181 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:09:36,775 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-12 16:09:36,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-12 16:09:36,776 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -34 predicate places. [2024-11-12 16:09:36,776 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-12 16:09:36,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:36,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:36,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:36,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:09:36,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:36,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:36,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1206103162, now seen corresponding path program 1 times [2024-11-12 16:09:36,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:36,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395223729] [2024-11-12 16:09:36,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:36,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:36,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395223729] [2024-11-12 16:09:36,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395223729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:36,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:36,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:09:36,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700428487] [2024-11-12 16:09:36,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:36,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:09:36,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:36,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:09:36,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:09:36,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 78 [2024-11-12 16:09:36,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:36,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:36,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 78 [2024-11-12 16:09:36,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:37,254 INFO L124 PetriNetUnfolderBase]: 839/1518 cut-off events. [2024-11-12 16:09:37,254 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-12 16:09:37,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 1518 events. 839/1518 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9688 event pairs, 839 based on Foata normal form. 48/1512 useless extension candidates. Maximal degree in co-relation 3030. Up to 1264 conditions per place. [2024-11-12 16:09:37,263 INFO L140 encePairwiseOnDemand]: 76/78 looper letters, 19 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-12 16:09:37,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 125 flow [2024-11-12 16:09:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:09:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:09:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-12 16:09:37,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31196581196581197 [2024-11-12 16:09:37,265 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 73 transitions. [2024-11-12 16:09:37,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 125 flow [2024-11-12 16:09:37,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:09:37,267 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-12 16:09:37,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-12 16:09:37,267 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -35 predicate places. [2024-11-12 16:09:37,268 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-12 16:09:37,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:37,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:37,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:37,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:09:37,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:37,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1206105066, now seen corresponding path program 1 times [2024-11-12 16:09:37,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:37,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018590053] [2024-11-12 16:09:37,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018590053] [2024-11-12 16:09:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018590053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:37,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:37,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:09:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909335366] [2024-11-12 16:09:37,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:37,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:09:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:37,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:09:37,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:09:37,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-11-12 16:09:37,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:37,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:37,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-11-12 16:09:37,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:38,119 INFO L124 PetriNetUnfolderBase]: 1698/2821 cut-off events. [2024-11-12 16:09:38,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:09:38,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 2821 events. 1698/2821 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16970 event pairs, 198 based on Foata normal form. 100/2878 useless extension candidates. Maximal degree in co-relation 5740. Up to 1579 conditions per place. [2024-11-12 16:09:38,134 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 43 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-11-12 16:09:38,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 236 flow [2024-11-12 16:09:38,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:09:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:09:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-11-12 16:09:38,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2024-11-12 16:09:38,136 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 107 transitions. [2024-11-12 16:09:38,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 236 flow [2024-11-12 16:09:38,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:09:38,139 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-11-12 16:09:38,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-11-12 16:09:38,140 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2024-11-12 16:09:38,140 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-11-12 16:09:38,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:38,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:38,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:09:38,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:38,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1567743620, now seen corresponding path program 1 times [2024-11-12 16:09:38,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:38,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133066183] [2024-11-12 16:09:38,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:38,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133066183] [2024-11-12 16:09:38,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133066183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:38,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:38,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:09:38,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12483527] [2024-11-12 16:09:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:38,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:09:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:38,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:09:38,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:09:38,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-11-12 16:09:38,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:38,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:38,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-11-12 16:09:38,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:38,929 INFO L124 PetriNetUnfolderBase]: 1056/1783 cut-off events. [2024-11-12 16:09:38,930 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2024-11-12 16:09:38,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4237 conditions, 1783 events. 1056/1783 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9460 event pairs, 110 based on Foata normal form. 82/1832 useless extension candidates. Maximal degree in co-relation 4226. Up to 697 conditions per place. [2024-11-12 16:09:38,938 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 54 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-11-12 16:09:38,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 338 flow [2024-11-12 16:09:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:09:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:09:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-11-12 16:09:38,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2024-11-12 16:09:38,940 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 135 transitions. [2024-11-12 16:09:38,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 338 flow [2024-11-12 16:09:38,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-12 16:09:38,943 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-11-12 16:09:38,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-12 16:09:38,944 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -28 predicate places. [2024-11-12 16:09:38,944 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-11-12 16:09:38,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:38,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:38,945 INFO L206 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-11-12 16:09:38,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:09:38,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:38,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1968878848, now seen corresponding path program 1 times [2024-11-12 16:09:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:38,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108072528] [2024-11-12 16:09:38,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:39,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:39,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108072528] [2024-11-12 16:09:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108072528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:39,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:39,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:09:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116348010] [2024-11-12 16:09:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:39,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:09:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:09:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:09:39,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-11-12 16:09:39,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:39,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:39,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-11-12 16:09:39,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:39,876 INFO L124 PetriNetUnfolderBase]: 599/996 cut-off events. [2024-11-12 16:09:39,876 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-11-12 16:09:39,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 996 events. 599/996 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4433 event pairs, 93 based on Foata normal form. 40/1003 useless extension candidates. Maximal degree in co-relation 2672. Up to 308 conditions per place. [2024-11-12 16:09:39,882 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 47 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-12 16:09:39,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 343 flow [2024-11-12 16:09:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:09:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:09:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-12 16:09:39,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30982905982905984 [2024-11-12 16:09:39,884 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 145 transitions. [2024-11-12 16:09:39,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 343 flow [2024-11-12 16:09:39,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 318 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-12 16:09:39,892 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-11-12 16:09:39,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-11-12 16:09:39,895 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -25 predicate places. [2024-11-12 16:09:39,896 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-11-12 16:09:39,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:39,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:39,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:39,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:09:39,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:39,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash -176980430, now seen corresponding path program 1 times [2024-11-12 16:09:39,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835626629] [2024-11-12 16:09:39,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:40,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:40,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835626629] [2024-11-12 16:09:40,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835626629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:40,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:09:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924337032] [2024-11-12 16:09:40,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:40,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:09:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:09:40,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:09:40,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-11-12 16:09:40,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:40,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:40,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-11-12 16:09:40,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:40,954 INFO L124 PetriNetUnfolderBase]: 995/1760 cut-off events. [2024-11-12 16:09:40,954 INFO L125 PetriNetUnfolderBase]: For 759/779 co-relation queries the response was YES. [2024-11-12 16:09:40,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 1760 events. 995/1760 cut-off events. For 759/779 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9516 event pairs, 219 based on Foata normal form. 8/1719 useless extension candidates. Maximal degree in co-relation 4261. Up to 680 conditions per place. [2024-11-12 16:09:40,964 INFO L140 encePairwiseOnDemand]: 71/78 looper letters, 35 selfloop transitions, 4 changer transitions 17/73 dead transitions. [2024-11-12 16:09:40,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 361 flow [2024-11-12 16:09:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:09:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:09:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-11-12 16:09:40,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3141025641025641 [2024-11-12 16:09:40,967 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 6 states and 147 transitions. [2024-11-12 16:09:40,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 361 flow [2024-11-12 16:09:40,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 297 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-12 16:09:40,976 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 139 flow [2024-11-12 16:09:40,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-12 16:09:40,977 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2024-11-12 16:09:40,977 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 139 flow [2024-11-12 16:09:40,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:40,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:40,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:40,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:09:40,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:40,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1861443000, now seen corresponding path program 2 times [2024-11-12 16:09:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:40,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739076572] [2024-11-12 16:09:40,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:42,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:42,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739076572] [2024-11-12 16:09:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739076572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:42,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:42,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:09:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230437600] [2024-11-12 16:09:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:42,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 16:09:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 16:09:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:09:42,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-11-12 16:09:42,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 139 flow. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:42,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:42,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-11-12 16:09:42,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:43,626 INFO L124 PetriNetUnfolderBase]: 1037/1896 cut-off events. [2024-11-12 16:09:43,627 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-11-12 16:09:43,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 1896 events. 1037/1896 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10805 event pairs, 75 based on Foata normal form. 16/1869 useless extension candidates. Maximal degree in co-relation 4072. Up to 485 conditions per place. [2024-11-12 16:09:43,634 INFO L140 encePairwiseOnDemand]: 66/78 looper letters, 41 selfloop transitions, 10 changer transitions 43/111 dead transitions. [2024-11-12 16:09:43,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 503 flow [2024-11-12 16:09:43,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 16:09:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 16:09:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2024-11-12 16:09:43,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3041958041958042 [2024-11-12 16:09:43,636 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 139 flow. Second operand 11 states and 261 transitions. [2024-11-12 16:09:43,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 503 flow [2024-11-12 16:09:43,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 484 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-12 16:09:43,640 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 194 flow [2024-11-12 16:09:43,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=194, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2024-11-12 16:09:43,641 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -12 predicate places. [2024-11-12 16:09:43,641 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 194 flow [2024-11-12 16:09:43,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:43,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:43,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:09:43,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -803684086, now seen corresponding path program 3 times [2024-11-12 16:09:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696976300] [2024-11-12 16:09:43,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:43,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:09:44,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696976300] [2024-11-12 16:09:44,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696976300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:44,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:44,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 16:09:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426096173] [2024-11-12 16:09:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:44,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:09:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:09:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:09:44,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:09:44,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-11-12 16:09:44,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:44,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:44,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-11-12 16:09:44,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:44,491 INFO L124 PetriNetUnfolderBase]: 638/1183 cut-off events. [2024-11-12 16:09:44,492 INFO L125 PetriNetUnfolderBase]: For 487/491 co-relation queries the response was YES. [2024-11-12 16:09:44,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1183 events. 638/1183 cut-off events. For 487/491 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5986 event pairs, 173 based on Foata normal form. 10/1156 useless extension candidates. Maximal degree in co-relation 2972. Up to 405 conditions per place. [2024-11-12 16:09:44,499 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 26 selfloop transitions, 2 changer transitions 35/80 dead transitions. [2024-11-12 16:09:44,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 419 flow [2024-11-12 16:09:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:09:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 16:09:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-11-12 16:09:44,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2967032967032967 [2024-11-12 16:09:44,501 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 194 flow. Second operand 7 states and 162 transitions. [2024-11-12 16:09:44,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 419 flow [2024-11-12 16:09:44,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 377 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-11-12 16:09:44,505 INFO L231 Difference]: Finished difference. Result has 68 places, 40 transitions, 143 flow [2024-11-12 16:09:44,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2024-11-12 16:09:44,506 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -15 predicate places. [2024-11-12 16:09:44,506 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 40 transitions, 143 flow [2024-11-12 16:09:44,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:44,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:44,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:44,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 16:09:44,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:44,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2086614572, now seen corresponding path program 4 times [2024-11-12 16:09:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:09:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423945675] [2024-11-12 16:09:44,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:09:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:09:44,631 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:09:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:09:44,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:09:44,831 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:09:44,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2024-11-12 16:09:44,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (67 of 69 remaining) [2024-11-12 16:09:44,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2024-11-12 16:09:44,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2024-11-12 16:09:44,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2024-11-12 16:09:44,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2024-11-12 16:09:44,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2024-11-12 16:09:44,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2024-11-12 16:09:44,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2024-11-12 16:09:44,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2024-11-12 16:09:44,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2024-11-12 16:09:44,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2024-11-12 16:09:44,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2024-11-12 16:09:44,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2024-11-12 16:09:44,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2024-11-12 16:09:44,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2024-11-12 16:09:44,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2024-11-12 16:09:44,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2024-11-12 16:09:44,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2024-11-12 16:09:44,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2024-11-12 16:09:44,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2024-11-12 16:09:44,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2024-11-12 16:09:44,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2024-11-12 16:09:44,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 69 remaining) [2024-11-12 16:09:44,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 69 remaining) [2024-11-12 16:09:44,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2024-11-12 16:09:44,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2024-11-12 16:09:44,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2024-11-12 16:09:44,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2024-11-12 16:09:44,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2024-11-12 16:09:44,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2024-11-12 16:09:44,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2024-11-12 16:09:44,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2024-11-12 16:09:44,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2024-11-12 16:09:44,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2024-11-12 16:09:44,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 69 remaining) [2024-11-12 16:09:44,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (32 of 69 remaining) [2024-11-12 16:09:44,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 69 remaining) [2024-11-12 16:09:44,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 69 remaining) [2024-11-12 16:09:44,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-11-12 16:09:44,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 69 remaining) [2024-11-12 16:09:44,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2024-11-12 16:09:44,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2024-11-12 16:09:44,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2024-11-12 16:09:44,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2024-11-12 16:09:44,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2024-11-12 16:09:44,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2024-11-12 16:09:44,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2024-11-12 16:09:44,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2024-11-12 16:09:44,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2024-11-12 16:09:44,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2024-11-12 16:09:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2024-11-12 16:09:44,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 69 remaining) [2024-11-12 16:09:44,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2024-11-12 16:09:44,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2024-11-12 16:09:44,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2024-11-12 16:09:44,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2024-11-12 16:09:44,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2024-11-12 16:09:44,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2024-11-12 16:09:44,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2024-11-12 16:09:44,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2024-11-12 16:09:44,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 16:09:44,850 INFO L421 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:09:44,972 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:09:44,972 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:09:44,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:09:44 BasicIcfg [2024-11-12 16:09:44,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:09:44,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:09:44,985 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:09:44,985 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:09:44,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:09:25" (3/4) ... [2024-11-12 16:09:44,992 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:09:44,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:09:44,994 INFO L158 Benchmark]: Toolchain (without parser) took 21176.82ms. Allocated memory was 121.6MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 51.2MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-12 16:09:44,994 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:09:44,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.37ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 51.2MB in the beginning and 110.9MB in the end (delta: -59.7MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-12 16:09:44,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.72ms. Allocated memory is still 159.4MB. Free memory was 110.9MB in the beginning and 108.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:09:44,995 INFO L158 Benchmark]: Boogie Preprocessor took 75.86ms. Allocated memory is still 159.4MB. Free memory was 108.6MB in the beginning and 103.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:09:44,995 INFO L158 Benchmark]: RCFGBuilder took 1344.33ms. Allocated memory is still 159.4MB. Free memory was 103.5MB in the beginning and 88.3MB in the end (delta: 15.3MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2024-11-12 16:09:44,996 INFO L158 Benchmark]: TraceAbstraction took 19096.43ms. Allocated memory was 159.4MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 87.2MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-12 16:09:44,996 INFO L158 Benchmark]: Witness Printer took 8.01ms. Allocated memory is still 6.0GB. Free memory is still 3.4GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:09:44,999 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.18ms. Allocated memory is still 121.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.37ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 51.2MB in the beginning and 110.9MB in the end (delta: -59.7MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.72ms. Allocated memory is still 159.4MB. Free memory was 110.9MB in the beginning and 108.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.86ms. Allocated memory is still 159.4MB. Free memory was 108.6MB in the beginning and 103.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1344.33ms. Allocated memory is still 159.4MB. Free memory was 103.5MB in the beginning and 88.3MB in the end (delta: 15.3MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19096.43ms. Allocated memory was 159.4MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 87.2MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 8.01ms. Allocated memory is still 6.0GB. Free memory is still 3.4GB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, t1781=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 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) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 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_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 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) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L17] 0 __assert_fail ("0", "safe000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 69 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: 18.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 503 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 23 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=12, InterpolantAutomatonStates: 62, 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.9s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 16:09:45,036 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/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/safe000_power.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 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:09:47,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:09:47,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 16:09:47,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:09:47,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:09:47,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:09:47,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:09:47,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:09:47,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:09:47,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:09:47,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:09:47,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:09:47,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:09:47,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:09:47,949 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:09:47,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:09:47,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:09:47,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:09:47,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:09:47,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:09:47,956 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:09:47,957 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:09:47,957 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:09:47,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:09:47,957 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:09:47,957 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 16:09:47,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:09:47,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 16:09:47,958 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:09:47,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:09:47,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:09:47,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:09:47,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:09:47,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:09:47,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:09:47,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:09:47,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:09:47,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:09:47,961 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 16:09:47,962 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 16:09:47,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:09:47,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:09:47,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:09:47,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:09:47,964 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2024-11-12 16:09:48,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:09:48,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:09:48,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:09:48,350 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:09:48,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:09:48,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2024-11-12 16:09:49,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:09:50,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:09:50,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2024-11-12 16:09:50,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2b44572/1193bdbfd3d6490dbd1c69267c30f45b/FLAG340fcd965 [2024-11-12 16:09:50,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2b44572/1193bdbfd3d6490dbd1c69267c30f45b [2024-11-12 16:09:50,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:09:50,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:09:50,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:09:50,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:09:50,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:09:50,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc74e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50, skipping insertion in model container [2024-11-12 16:09:50,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:09:50,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:09:50,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:09:50,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:09:50,862 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:09:50,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50 WrapperNode [2024-11-12 16:09:50,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:09:50,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:09:50,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:09:50,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:09:50,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,922 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2024-11-12 16:09:50,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:09:50,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:09:50,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:09:50,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:09:50,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,969 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-11-12 16:09:50,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:50,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:51,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:51,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:51,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:09:51,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:09:51,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:09:51,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:09:51,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (1/1) ... [2024-11-12 16:09:51,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:09:51,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:09:51,047 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-11-12 16:09:51,053 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-11-12 16:09:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 16:09:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 16:09:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 16:09:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:09:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 16:09:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 16:09:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 16:09:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 16:09:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 16:09:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 16:09:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-12 16:09:51,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-12 16:09:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-12 16:09:51,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-12 16:09:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-12 16:09:51,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-12 16:09:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 16:09:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:09:51,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:09:51,108 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:09:51,321 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:09:51,323 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:09:51,980 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:09:51,981 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:09:52,677 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:09:52,678 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 16:09:52,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:09:52 BoogieIcfgContainer [2024-11-12 16:09:52,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:09:52,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:09:52,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:09:52,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:09:52,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:09:50" (1/3) ... [2024-11-12 16:09:52,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b06da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:09:52, skipping insertion in model container [2024-11-12 16:09:52,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:50" (2/3) ... [2024-11-12 16:09:52,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b06da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:09:52, skipping insertion in model container [2024-11-12 16:09:52,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:09:52" (3/3) ... [2024-11-12 16:09:52,686 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2024-11-12 16:09:52,702 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:09:52,702 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-12 16:09:52,702 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:09:52,871 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 16:09:52,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 78 transitions, 168 flow [2024-11-12 16:09:52,967 INFO L124 PetriNetUnfolderBase]: 2/75 cut-off events. [2024-11-12 16:09:52,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:09:52,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 75 events. 2/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 293 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2024-11-12 16:09:52,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 78 transitions, 168 flow [2024-11-12 16:09:52,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 75 transitions, 159 flow [2024-11-12 16:09:52,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:09:52,991 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;@53174075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:09:52,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-11-12 16:09:52,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:09:52,999 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-12 16:09:52,999 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:09:52,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:53,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 16:09:53,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:53,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash 841306781, now seen corresponding path program 1 times [2024-11-12 16:09:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:09:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395010456] [2024-11-12 16:09:53,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:53,019 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-11-12 16:09:53,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:09:53,022 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-11-12 16:09:53,023 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-11-12 16:09:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:53,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:09:53,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:09:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:53,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:09:53,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:09:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395010456] [2024-11-12 16:09:53,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395010456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:53,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:53,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:09:53,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74171969] [2024-11-12 16:09:53,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:53,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:09:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:09:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:09:53,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:09:53,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:09:53,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:53,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:53,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:09:53,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:09:58,574 INFO L124 PetriNetUnfolderBase]: 21849/32043 cut-off events. [2024-11-12 16:09:58,574 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-12 16:09:58,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62652 conditions, 32043 events. 21849/32043 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 3494. Compared 250234 event pairs, 7194 based on Foata normal form. 1120/15454 useless extension candidates. Maximal degree in co-relation 62641. Up to 27560 conditions per place. [2024-11-12 16:09:58,804 INFO L140 encePairwiseOnDemand]: 59/78 looper letters, 73 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-11-12 16:09:58,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 345 flow [2024-11-12 16:09:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:09:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:09:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-11-12 16:09:58,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-11-12 16:09:58,819 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 159 flow. Second operand 3 states and 162 transitions. [2024-11-12 16:09:58,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 345 flow [2024-11-12 16:09:58,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 340 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:09:58,830 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2024-11-12 16:09:58,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-12 16:09:58,836 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2024-11-12 16:09:58,838 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2024-11-12 16:09:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:09:58,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:09:58,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:09:58,844 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-11-12 16:09:59,039 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-11-12 16:09:59,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:09:59,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:09:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash 309769669, now seen corresponding path program 1 times [2024-11-12 16:09:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:09:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873501024] [2024-11-12 16:09:59,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:09:59,043 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-11-12 16:09:59,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:09:59,046 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-11-12 16:09:59,047 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-11-12 16:09:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:09:59,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:09:59,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:09:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:09:59,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:09:59,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:09:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873501024] [2024-11-12 16:09:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873501024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:09:59,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:09:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:09:59,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709210818] [2024-11-12 16:09:59,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:09:59,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:09:59,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:09:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:09:59,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:09:59,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:09:59,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 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-11-12 16:09:59,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:09:59,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:09:59,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:01,571 INFO L124 PetriNetUnfolderBase]: 6742/10734 cut-off events. [2024-11-12 16:10:01,573 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2024-11-12 16:10:01,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20876 conditions, 10734 events. 6742/10734 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 85413 event pairs, 6742 based on Foata normal form. 0/6507 useless extension candidates. Maximal degree in co-relation 20866. Up to 9569 conditions per place. [2024-11-12 16:10:01,659 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 32 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2024-11-12 16:10:01,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 172 flow [2024-11-12 16:10:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:10:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:10:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-12 16:10:01,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-11-12 16:10:01,665 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 3 states and 96 transitions. [2024-11-12 16:10:01,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 172 flow [2024-11-12 16:10:01,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:10:01,669 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 104 flow [2024-11-12 16:10:01,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-11-12 16:10:01,670 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2024-11-12 16:10:01,670 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 104 flow [2024-11-12 16:10:01,671 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-11-12 16:10:01,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:01,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:10:01,676 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-11-12 16:10:01,872 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-11-12 16:10:01,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:01,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:01,873 INFO L85 PathProgramCache]: Analyzing trace with hash 309769670, now seen corresponding path program 1 times [2024-11-12 16:10:01,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:01,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149106227] [2024-11-12 16:10:01,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:10:01,874 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-11-12 16:10:01,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:01,878 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-11-12 16:10:01,880 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-11-12 16:10:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:10:01,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:10:01,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:02,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:02,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:02,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149106227] [2024-11-12 16:10:02,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149106227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:02,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:02,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:10:02,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115606717] [2024-11-12 16:10:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:02,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:10:02,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:10:02,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:10:02,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:10:02,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 104 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-11-12 16:10:02,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:02,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:10:02,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:02,591 INFO L124 PetriNetUnfolderBase]: 1151/2022 cut-off events. [2024-11-12 16:10:02,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:10:02,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3788 conditions, 2022 events. 1151/2022 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13373 event pairs, 1151 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 3782. Up to 1720 conditions per place. [2024-11-12 16:10:02,599 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-12 16:10:02,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 134 flow [2024-11-12 16:10:02,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:10:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:10:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-12 16:10:02,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2024-11-12 16:10:02,601 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 104 flow. Second operand 3 states and 87 transitions. [2024-11-12 16:10:02,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 134 flow [2024-11-12 16:10:02,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:10:02,602 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-12 16:10:02,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-12 16:10:02,603 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -34 predicate places. [2024-11-12 16:10:02,604 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-12 16:10:02,604 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-11-12 16:10:02,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:02,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:02,609 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-11-12 16:10:02,805 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-11-12 16:10:02,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash 600621977, now seen corresponding path program 1 times [2024-11-12 16:10:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:02,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635341562] [2024-11-12 16:10:02,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:10:02,807 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-11-12 16:10:02,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:02,809 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-11-12 16:10:02,810 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-11-12 16:10:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:10:02,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:10:02,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:02,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:02,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635341562] [2024-11-12 16:10:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635341562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:10:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129590620] [2024-11-12 16:10:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:10:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:10:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:10:02,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-11-12 16:10:02,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:02,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:02,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-11-12 16:10:02,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:03,445 INFO L124 PetriNetUnfolderBase]: 2241/3692 cut-off events. [2024-11-12 16:10:03,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:10:03,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7099 conditions, 3692 events. 2241/3692 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23164 event pairs, 198 based on Foata normal form. 100/3585 useless extension candidates. Maximal degree in co-relation 7092. Up to 2368 conditions per place. [2024-11-12 16:10:03,462 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 46 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2024-11-12 16:10:03,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 243 flow [2024-11-12 16:10:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:10:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:10:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-12 16:10:03,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3525641025641026 [2024-11-12 16:10:03,464 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 4 states and 110 transitions. [2024-11-12 16:10:03,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 243 flow [2024-11-12 16:10:03,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:10:03,467 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 118 flow [2024-11-12 16:10:03,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-12 16:10:03,468 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2024-11-12 16:10:03,468 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 118 flow [2024-11-12 16:10:03,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:03,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:03,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:03,475 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-11-12 16:10:03,669 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-11-12 16:10:03,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:03,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1728330127, now seen corresponding path program 1 times [2024-11-12 16:10:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981417756] [2024-11-12 16:10:03,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:10:03,671 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-11-12 16:10:03,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:03,673 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-11-12 16:10:03,674 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-11-12 16:10:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:10:03,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:10:03,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:03,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:03,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:03,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981417756] [2024-11-12 16:10:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981417756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:03,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:03,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:10:03,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419020322] [2024-11-12 16:10:03,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:03,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:10:03,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:10:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:10:03,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-11-12 16:10:03,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:03,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:03,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-11-12 16:10:03,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:04,255 INFO L124 PetriNetUnfolderBase]: 1284/2171 cut-off events. [2024-11-12 16:10:04,255 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2024-11-12 16:10:04,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4832 conditions, 2171 events. 1284/2171 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12016 event pairs, 110 based on Foata normal form. 82/2140 useless extension candidates. Maximal degree in co-relation 4822. Up to 1045 conditions per place. [2024-11-12 16:10:04,264 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 57 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2024-11-12 16:10:04,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 343 flow [2024-11-12 16:10:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:10:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:10:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-12 16:10:04,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35384615384615387 [2024-11-12 16:10:04,266 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 118 flow. Second operand 5 states and 138 transitions. [2024-11-12 16:10:04,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 343 flow [2024-11-12 16:10:04,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 333 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-12 16:10:04,269 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 158 flow [2024-11-12 16:10:04,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-12 16:10:04,270 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -27 predicate places. [2024-11-12 16:10:04,270 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 158 flow [2024-11-12 16:10:04,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:04,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:04,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:04,275 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-11-12 16:10:04,471 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-11-12 16:10:04,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:04,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2060642704, now seen corresponding path program 1 times [2024-11-12 16:10:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:04,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826937635] [2024-11-12 16:10:04,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:10:04,473 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-11-12 16:10:04,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:04,474 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-11-12 16:10:04,475 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-11-12 16:10:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:10:04,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:10:04,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:04,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:04,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:04,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826937635] [2024-11-12 16:10:04,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826937635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:04,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:04,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:10:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270659511] [2024-11-12 16:10:04,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:04,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:10:04,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:10:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:10:04,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-11-12 16:10:04,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:04,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:04,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-11-12 16:10:04,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:05,112 INFO L124 PetriNetUnfolderBase]: 635/1064 cut-off events. [2024-11-12 16:10:05,112 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-11-12 16:10:05,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2704 conditions, 1064 events. 635/1064 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4743 event pairs, 93 based on Foata normal form. 40/1055 useless extension candidates. Maximal degree in co-relation 2692. Up to 308 conditions per place. [2024-11-12 16:10:05,117 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 50 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2024-11-12 16:10:05,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 350 flow [2024-11-12 16:10:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:10:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:10:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-12 16:10:05,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3162393162393162 [2024-11-12 16:10:05,118 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 158 flow. Second operand 6 states and 148 transitions. [2024-11-12 16:10:05,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 350 flow [2024-11-12 16:10:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 325 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-12 16:10:05,125 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 172 flow [2024-11-12 16:10:05,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-11-12 16:10:05,125 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2024-11-12 16:10:05,126 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 172 flow [2024-11-12 16:10:05,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:05,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:05,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:05,132 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-11-12 16:10:05,330 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-11-12 16:10:05,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:05,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:05,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1878216288, now seen corresponding path program 1 times [2024-11-12 16:10:05,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:05,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717649969] [2024-11-12 16:10:05,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:10:05,333 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-11-12 16:10:05,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:05,336 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-11-12 16:10:05,336 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-11-12 16:10:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:10:05,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:10:05,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:05,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:05,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717649969] [2024-11-12 16:10:05,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717649969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:05,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:05,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:10:05,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263677191] [2024-11-12 16:10:05,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:05,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:10:05,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:05,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:10:05,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:10:05,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:10:05,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:05,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:05,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:10:05,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:06,026 INFO L124 PetriNetUnfolderBase]: 352/698 cut-off events. [2024-11-12 16:10:06,026 INFO L125 PetriNetUnfolderBase]: For 285/295 co-relation queries the response was YES. [2024-11-12 16:10:06,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 698 events. 352/698 cut-off events. For 285/295 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3386 event pairs, 70 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 1570. Up to 460 conditions per place. [2024-11-12 16:10:06,030 INFO L140 encePairwiseOnDemand]: 75/78 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-12 16:10:06,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 248 flow [2024-11-12 16:10:06,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:10:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:10:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-12 16:10:06,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3301282051282051 [2024-11-12 16:10:06,032 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 172 flow. Second operand 4 states and 103 transitions. [2024-11-12 16:10:06,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 248 flow [2024-11-12 16:10:06,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 192 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-12 16:10:06,035 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 118 flow [2024-11-12 16:10:06,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-12 16:10:06,037 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2024-11-12 16:10:06,038 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 118 flow [2024-11-12 16:10:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:06,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:06,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:06,044 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-11-12 16:10:06,238 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-11-12 16:10:06,239 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:06,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1073713825, now seen corresponding path program 1 times [2024-11-12 16:10:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:06,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483260120] [2024-11-12 16:10:06,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:10:06,241 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-11-12 16:10:06,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:06,242 INFO L229 MonitoredProcess]: Starting monitored process 9 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-11-12 16:10:06,243 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 (9)] Waiting until timeout for monitored process [2024-11-12 16:10:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:10:06,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:10:06,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:06,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:06,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483260120] [2024-11-12 16:10:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483260120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:10:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103305471] [2024-11-12 16:10:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:10:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:10:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:10:06,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-11-12 16:10:06,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:06,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:06,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-11-12 16:10:06,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:06,768 INFO L124 PetriNetUnfolderBase]: 340/678 cut-off events. [2024-11-12 16:10:06,768 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-12 16:10:06,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 678 events. 340/678 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3291 event pairs, 66 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1352. Up to 440 conditions per place. [2024-11-12 16:10:06,771 INFO L140 encePairwiseOnDemand]: 75/78 looper letters, 27 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-12 16:10:06,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 192 flow [2024-11-12 16:10:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:10:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:10:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-11-12 16:10:06,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2024-11-12 16:10:06,772 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 118 flow. Second operand 4 states and 102 transitions. [2024-11-12 16:10:06,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 192 flow [2024-11-12 16:10:06,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:10:06,774 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 117 flow [2024-11-12 16:10:06,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-11-12 16:10:06,774 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2024-11-12 16:10:06,775 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 117 flow [2024-11-12 16:10:06,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:06,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:06,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:06,780 INFO L540 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 (9)] Forceful destruction successful, exit code 0 [2024-11-12 16:10:06,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-11-12 16:10:06,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash -958953086, now seen corresponding path program 1 times [2024-11-12 16:10:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:06,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321206163] [2024-11-12 16:10:06,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:10:06,980 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-11-12 16:10:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:06,983 INFO L229 MonitoredProcess]: Starting monitored process 10 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-11-12 16:10:06,985 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 (10)] Waiting until timeout for monitored process [2024-11-12 16:10:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:10:07,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:10:07,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:07,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:07,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:07,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321206163] [2024-11-12 16:10:07,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321206163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:07,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:07,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:10:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402362455] [2024-11-12 16:10:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:07,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:10:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:10:07,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:10:07,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 78 [2024-11-12 16:10:07,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:07,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:07,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 78 [2024-11-12 16:10:07,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:07,371 INFO L124 PetriNetUnfolderBase]: 339/644 cut-off events. [2024-11-12 16:10:07,371 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-12 16:10:07,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 644 events. 339/644 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3115 event pairs, 315 based on Foata normal form. 8/580 useless extension candidates. Maximal degree in co-relation 1338. Up to 529 conditions per place. [2024-11-12 16:10:07,375 INFO L140 encePairwiseOnDemand]: 76/78 looper letters, 19 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-12 16:10:07,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 157 flow [2024-11-12 16:10:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:10:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:10:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-12 16:10:07,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31196581196581197 [2024-11-12 16:10:07,376 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 117 flow. Second operand 3 states and 73 transitions. [2024-11-12 16:10:07,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 157 flow [2024-11-12 16:10:07,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:10:07,381 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 112 flow [2024-11-12 16:10:07,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-11-12 16:10:07,382 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2024-11-12 16:10:07,383 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 112 flow [2024-11-12 16:10:07,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:07,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:07,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:07,390 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 (10)] Ended with exit code 0 [2024-11-12 16:10:07,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-11-12 16:10:07,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:07,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1871580686, now seen corresponding path program 1 times [2024-11-12 16:10:07,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:07,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447946913] [2024-11-12 16:10:07,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:10:07,586 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-11-12 16:10:07,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:07,587 INFO L229 MonitoredProcess]: Starting monitored process 11 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-11-12 16:10:07,588 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 (11)] Waiting until timeout for monitored process [2024-11-12 16:10:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:10:07,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:10:07,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:07,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:07,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:07,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447946913] [2024-11-12 16:10:07,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447946913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:07,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:07,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:10:07,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200411397] [2024-11-12 16:10:07,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:07,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:10:07,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:07,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:10:07,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:10:07,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-11-12 16:10:07,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:07,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:07,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-11-12 16:10:07,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:08,411 INFO L124 PetriNetUnfolderBase]: 995/1760 cut-off events. [2024-11-12 16:10:08,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:10:08,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3720 conditions, 1760 events. 995/1760 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9557 event pairs, 219 based on Foata normal form. 8/1719 useless extension candidates. Maximal degree in co-relation 3711. Up to 680 conditions per place. [2024-11-12 16:10:08,418 INFO L140 encePairwiseOnDemand]: 71/78 looper letters, 35 selfloop transitions, 4 changer transitions 17/73 dead transitions. [2024-11-12 16:10:08,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 298 flow [2024-11-12 16:10:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:10:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:10:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-11-12 16:10:08,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3141025641025641 [2024-11-12 16:10:08,419 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 112 flow. Second operand 6 states and 147 transitions. [2024-11-12 16:10:08,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 298 flow [2024-11-12 16:10:08,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:10:08,421 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 139 flow [2024-11-12 16:10:08,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-12 16:10:08,422 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2024-11-12 16:10:08,422 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 139 flow [2024-11-12 16:10:08,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:08,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:08,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:08,430 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 (11)] Ended with exit code 0 [2024-11-12 16:10:08,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-11-12 16:10:08,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 805075508, now seen corresponding path program 2 times [2024-11-12 16:10:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775118241] [2024-11-12 16:10:08,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:10:08,629 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-11-12 16:10:08,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:08,630 INFO L229 MonitoredProcess]: Starting monitored process 12 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-11-12 16:10:08,631 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 (12)] Waiting until timeout for monitored process [2024-11-12 16:10:08,783 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 16:10:08,784 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:10:08,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:10:08,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:08,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:08,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775118241] [2024-11-12 16:10:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775118241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:08,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:08,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:10:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249123244] [2024-11-12 16:10:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:08,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:10:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:08,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:10:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:10:08,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-11-12 16:10:08,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:08,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:08,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-11-12 16:10:08,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:09,192 INFO L124 PetriNetUnfolderBase]: 728/1341 cut-off events. [2024-11-12 16:10:09,192 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-12 16:10:09,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 1341 events. 728/1341 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7183 event pairs, 231 based on Foata normal form. 8/1306 useless extension candidates. Maximal degree in co-relation 2882. Up to 614 conditions per place. [2024-11-12 16:10:09,197 INFO L140 encePairwiseOnDemand]: 71/78 looper letters, 29 selfloop transitions, 3 changer transitions 17/66 dead transitions. [2024-11-12 16:10:09,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 295 flow [2024-11-12 16:10:09,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:10:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:10:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-11-12 16:10:09,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29914529914529914 [2024-11-12 16:10:09,199 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 139 flow. Second operand 6 states and 140 transitions. [2024-11-12 16:10:09,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 295 flow [2024-11-12 16:10:09,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 280 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-12 16:10:09,201 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 133 flow [2024-11-12 16:10:09,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-11-12 16:10:09,202 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -22 predicate places. [2024-11-12 16:10:09,202 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 133 flow [2024-11-12 16:10:09,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:09,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:09,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:09,208 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 (12)] Ended with exit code 0 [2024-11-12 16:10:09,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-11-12 16:10:09,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:09,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash -963289432, now seen corresponding path program 3 times [2024-11-12 16:10:09,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:09,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483313863] [2024-11-12 16:10:09,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:10:09,405 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-11-12 16:10:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:09,406 INFO L229 MonitoredProcess]: Starting monitored process 13 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-11-12 16:10:09,407 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 (13)] Waiting until timeout for monitored process [2024-11-12 16:10:09,582 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-12 16:10:09,582 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:10:09,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:10:09,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:10:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:10:09,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:10:09,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:10:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483313863] [2024-11-12 16:10:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483313863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:10:09,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:10:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 16:10:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744372096] [2024-11-12 16:10:09,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:10:09,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:10:09,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:10:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:10:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:10:09,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-11-12 16:10:09,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:09,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:10:09,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-11-12 16:10:09,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:10:09,988 INFO L124 PetriNetUnfolderBase]: 579/1074 cut-off events. [2024-11-12 16:10:09,989 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-12 16:10:09,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 1074 events. 579/1074 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5234 event pairs, 165 based on Foata normal form. 8/1053 useless extension candidates. Maximal degree in co-relation 2238. Up to 405 conditions per place. [2024-11-12 16:10:09,994 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 26 selfloop transitions, 2 changer transitions 28/73 dead transitions. [2024-11-12 16:10:09,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 322 flow [2024-11-12 16:10:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:10:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 16:10:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-11-12 16:10:09,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2967032967032967 [2024-11-12 16:10:09,997 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 133 flow. Second operand 7 states and 162 transitions. [2024-11-12 16:10:09,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 322 flow [2024-11-12 16:10:09,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 298 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-12 16:10:10,001 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 129 flow [2024-11-12 16:10:10,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2024-11-12 16:10:10,002 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -21 predicate places. [2024-11-12 16:10:10,002 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 129 flow [2024-11-12 16:10:10,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:10:10,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:10:10,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:10,010 INFO L540 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 (13)] Forceful destruction successful, exit code 0 [2024-11-12 16:10:10,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-11-12 16:10:10,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-11-12 16:10:10,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:10:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash 473512478, now seen corresponding path program 4 times [2024-11-12 16:10:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:10:10,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109798006] [2024-11-12 16:10:10,208 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 16:10:10,208 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-11-12 16:10:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:10:10,210 INFO L229 MonitoredProcess]: Starting monitored process 14 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-11-12 16:10:10,211 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 (14)] Waiting until timeout for monitored process [2024-11-12 16:10:10,377 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 16:10:10,378 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-12 16:10:10,378 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:10:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:10:10,545 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 16:10:10,546 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:10:10,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2024-11-12 16:10:10,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (67 of 69 remaining) [2024-11-12 16:10:10,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2024-11-12 16:10:10,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2024-11-12 16:10:10,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2024-11-12 16:10:10,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2024-11-12 16:10:10,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2024-11-12 16:10:10,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2024-11-12 16:10:10,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2024-11-12 16:10:10,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2024-11-12 16:10:10,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2024-11-12 16:10:10,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2024-11-12 16:10:10,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2024-11-12 16:10:10,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2024-11-12 16:10:10,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2024-11-12 16:10:10,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2024-11-12 16:10:10,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2024-11-12 16:10:10,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2024-11-12 16:10:10,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2024-11-12 16:10:10,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2024-11-12 16:10:10,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2024-11-12 16:10:10,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2024-11-12 16:10:10,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2024-11-12 16:10:10,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 69 remaining) [2024-11-12 16:10:10,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 69 remaining) [2024-11-12 16:10:10,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2024-11-12 16:10:10,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2024-11-12 16:10:10,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2024-11-12 16:10:10,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2024-11-12 16:10:10,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2024-11-12 16:10:10,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2024-11-12 16:10:10,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2024-11-12 16:10:10,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2024-11-12 16:10:10,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2024-11-12 16:10:10,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2024-11-12 16:10:10,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 69 remaining) [2024-11-12 16:10:10,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (32 of 69 remaining) [2024-11-12 16:10:10,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 69 remaining) [2024-11-12 16:10:10,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 69 remaining) [2024-11-12 16:10:10,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-11-12 16:10:10,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 69 remaining) [2024-11-12 16:10:10,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2024-11-12 16:10:10,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2024-11-12 16:10:10,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2024-11-12 16:10:10,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2024-11-12 16:10:10,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2024-11-12 16:10:10,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2024-11-12 16:10:10,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2024-11-12 16:10:10,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2024-11-12 16:10:10,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2024-11-12 16:10:10,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2024-11-12 16:10:10,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2024-11-12 16:10:10,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2024-11-12 16:10:10,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2024-11-12 16:10:10,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2024-11-12 16:10:10,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2024-11-12 16:10:10,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2024-11-12 16:10:10,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2024-11-12 16:10:10,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2024-11-12 16:10:10,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2024-11-12 16:10:10,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 69 remaining) [2024-11-12 16:10:10,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2024-11-12 16:10:10,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2024-11-12 16:10:10,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2024-11-12 16:10:10,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2024-11-12 16:10:10,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2024-11-12 16:10:10,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2024-11-12 16:10:10,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2024-11-12 16:10:10,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2024-11-12 16:10:10,568 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 (14)] Ended with exit code 0 [2024-11-12 16:10:10,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-11-12 16:10:10,760 INFO L421 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:10:10,874 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:10:10,874 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:10:10,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:10:10 BasicIcfg [2024-11-12 16:10:10,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:10:10,884 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:10:10,884 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:10:10,884 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:10:10,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:09:52" (3/4) ... [2024-11-12 16:10:10,887 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:10:10,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:10:10,888 INFO L158 Benchmark]: Toolchain (without parser) took 20655.18ms. Allocated memory was 62.9MB in the beginning and 5.7GB in the end (delta: 5.7GB). Free memory was 38.4MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 541.8MB. Max. memory is 16.1GB. [2024-11-12 16:10:10,889 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 46.1MB. Free memory is still 22.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:10:10,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.34ms. Allocated memory is still 62.9MB. Free memory was 38.3MB in the beginning and 28.0MB in the end (delta: 10.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 16:10:10,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.41ms. Allocated memory is still 62.9MB. Free memory was 28.0MB in the beginning and 25.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:10:10,890 INFO L158 Benchmark]: Boogie Preprocessor took 88.80ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 25.1MB in the beginning and 56.7MB in the end (delta: -31.5MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-12 16:10:10,890 INFO L158 Benchmark]: RCFGBuilder took 1665.94ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 56.7MB in the beginning and 65.0MB in the end (delta: -8.3MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2024-11-12 16:10:10,891 INFO L158 Benchmark]: TraceAbstraction took 18203.30ms. Allocated memory was 107.0MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 63.8MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 519.8MB. Max. memory is 16.1GB. [2024-11-12 16:10:10,891 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 5.7GB. Free memory is still 5.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:10:10,892 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 46.1MB. Free memory is still 22.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.34ms. Allocated memory is still 62.9MB. Free memory was 38.3MB in the beginning and 28.0MB in the end (delta: 10.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.41ms. Allocated memory is still 62.9MB. Free memory was 28.0MB in the beginning and 25.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.80ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 25.1MB in the beginning and 56.7MB in the end (delta: -31.5MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1665.94ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 56.7MB in the beginning and 65.0MB in the end (delta: -8.3MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18203.30ms. Allocated memory was 107.0MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 63.8MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 519.8MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 5.7GB. Free memory is still 5.2GB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, t1781=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 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) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 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_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 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) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L17] 0 __assert_fail ("0", "safe000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 69 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1085 IncrementalHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 10 mSDtfsCounter, 1085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=6, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1143 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1827 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 16:10:10,930 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