./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/weaver/popl20-bad-buffer-mult-alt3.wvr.c -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 fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:17:07,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:17:07,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:17:07,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:17:07,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:17:07,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:17:07,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:17:07,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:17:07,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:17:07,836 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:17:07,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:17:07,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:17:07,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:17:07,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:17:07,839 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:17:07,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:17:07,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:17:07,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:17:07,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:17:07,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:17:07,840 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:17:07,842 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:17:07,842 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:17:07,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:17:07,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:17:07,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:17:07,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:17:07,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:17:07,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:17:07,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:17:07,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:17:07,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:17:07,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:17:07,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:17:07,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:17:07,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:17:07,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:17:07,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:17:07,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:17:07,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:17:07,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:17:07,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:17:07,847 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2024-11-10 18:17:08,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:17:08,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:17:08,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:17:08,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:17:08,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:17:08,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-10 18:17:09,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:17:09,915 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:17:09,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-10 18:17:09,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837840009/03d79b7ca1c543f7bec30789487e3000/FLAG268ac6177 [2024-11-10 18:17:10,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837840009/03d79b7ca1c543f7bec30789487e3000 [2024-11-10 18:17:10,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:17:10,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:17:10,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:17:10,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:17:10,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:17:10,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212f6a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10, skipping insertion in model container [2024-11-10 18:17:10,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:17:10,549 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:17:10,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:17:10,569 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:17:10,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:17:10,630 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:17:10,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10 WrapperNode [2024-11-10 18:17:10,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:17:10,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:17:10,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:17:10,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:17:10,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,692 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 307 [2024-11-10 18:17:10,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:17:10,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:17:10,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:17:10,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:17:10,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,736 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-10 18:17:10,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:17:10,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:17:10,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:17:10,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:17:10,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (1/1) ... [2024-11-10 18:17:10,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:17:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:17:10,791 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-10 18:17:10,793 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-10 18:17:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:17:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 18:17:10,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 18:17:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 18:17:10,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 18:17:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 18:17:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 18:17:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-10 18:17:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-10 18:17:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:17:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:17:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:17:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:17:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:17:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:17:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:17:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:17:10,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:17:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:17:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:17:10,850 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:17:11,019 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:17:11,021 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:17:11,578 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:17:11,579 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:17:11,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:17:11,875 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:17:11,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:17:11 BoogieIcfgContainer [2024-11-10 18:17:11,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:17:11,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:17:11,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:17:11,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:17:11,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:17:10" (1/3) ... [2024-11-10 18:17:11,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b16eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:17:11, skipping insertion in model container [2024-11-10 18:17:11,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:10" (2/3) ... [2024-11-10 18:17:11,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b16eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:17:11, skipping insertion in model container [2024-11-10 18:17:11,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:17:11" (3/3) ... [2024-11-10 18:17:11,885 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-10 18:17:11,899 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:17:11,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-10 18:17:11,900 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:17:11,972 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-10 18:17:12,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 196 flow [2024-11-10 18:17:12,099 INFO L124 PetriNetUnfolderBase]: 12/80 cut-off events. [2024-11-10 18:17:12,099 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 18:17:12,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 80 events. 12/80 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2024-11-10 18:17:12,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 84 transitions, 196 flow [2024-11-10 18:17:12,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 79 transitions, 182 flow [2024-11-10 18:17:12,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:17:12,143 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;@283e1b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:17:12,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-10 18:17:12,152 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:17:12,154 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2024-11-10 18:17:12,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:17:12,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:12,155 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:17:12,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:12,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 25466122, now seen corresponding path program 1 times [2024-11-10 18:17:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:12,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793368708] [2024-11-10 18:17:12,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:12,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-10 18:17:12,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:12,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793368708] [2024-11-10 18:17:12,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793368708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:12,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:12,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:17:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845164098] [2024-11-10 18:17:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:12,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:17:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:17:12,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:17:12,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:12,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-10 18:17:12,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:12,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:15,466 INFO L124 PetriNetUnfolderBase]: 15159/20875 cut-off events. [2024-11-10 18:17:15,466 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2024-11-10 18:17:15,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41566 conditions, 20875 events. 15159/20875 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 140146 event pairs, 12544 based on Foata normal form. 2616/16964 useless extension candidates. Maximal degree in co-relation 38980. Up to 19683 conditions per place. [2024-11-10 18:17:15,733 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 44 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-11-10 18:17:15,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 254 flow [2024-11-10 18:17:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:17:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:17:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-11-10 18:17:15,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2024-11-10 18:17:15,747 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 182 flow. Second operand 3 states and 139 transitions. [2024-11-10 18:17:15,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 254 flow [2024-11-10 18:17:15,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 238 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-10 18:17:15,771 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 150 flow [2024-11-10 18:17:15,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2024-11-10 18:17:15,775 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, -10 predicate places. [2024-11-10 18:17:15,775 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 150 flow [2024-11-10 18:17:15,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-10 18:17:15,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:15,776 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:17:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:17:15,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:15,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 25466123, now seen corresponding path program 1 times [2024-11-10 18:17:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94578840] [2024-11-10 18:17:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:15,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:15,971 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-10 18:17:15,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:15,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94578840] [2024-11-10 18:17:15,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94578840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:15,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:15,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:17:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397980837] [2024-11-10 18:17:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:15,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:17:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:15,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:17:15,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:17:16,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:16,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-10 18:17:16,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:16,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:16,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:17,675 INFO L124 PetriNetUnfolderBase]: 15160/20880 cut-off events. [2024-11-10 18:17:17,675 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-10 18:17:17,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40929 conditions, 20880 events. 15160/20880 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 139907 event pairs, 12544 based on Foata normal form. 0/14351 useless extension candidates. Maximal degree in co-relation 40894. Up to 19692 conditions per place. [2024-11-10 18:17:17,808 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 47 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-10 18:17:17,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 258 flow [2024-11-10 18:17:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:17:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:17:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-11-10 18:17:17,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-11-10 18:17:17,810 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 150 flow. Second operand 4 states and 164 transitions. [2024-11-10 18:17:17,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 258 flow [2024-11-10 18:17:17,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:17:17,813 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 173 flow [2024-11-10 18:17:17,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2024-11-10 18:17:17,814 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, -7 predicate places. [2024-11-10 18:17:17,814 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 173 flow [2024-11-10 18:17:17,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-10 18:17:17,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:17,815 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2024-11-10 18:17:17,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:17:17,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:17,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:17,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1547112133, now seen corresponding path program 1 times [2024-11-10 18:17:17,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:17,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344085461] [2024-11-10 18:17:17,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344085461] [2024-11-10 18:17:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344085461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:17:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120942338] [2024-11-10 18:17:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:18,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:17:18,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:17:18,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:17:18,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:17:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:18,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 18:17:18,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:17:18,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-10 18:17:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:18,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:17:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:18,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120942338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:17:18,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:17:18,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-10 18:17:18,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595768974] [2024-11-10 18:17:18,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:17:18,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:17:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:18,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:17:18,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:17:18,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 84 [2024-11-10 18:17:18,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 173 flow. Second operand has 11 states, 11 states have (on average 27.363636363636363) internal successors, (301), 11 states have internal predecessors, (301), 0 states have call successors, (0), 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-10 18:17:18,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:18,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 84 [2024-11-10 18:17:18,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:20,704 INFO L124 PetriNetUnfolderBase]: 15160/20879 cut-off events. [2024-11-10 18:17:20,704 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-10 18:17:20,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40940 conditions, 20879 events. 15160/20879 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 140133 event pairs, 12544 based on Foata normal form. 0/14350 useless extension candidates. Maximal degree in co-relation 40915. Up to 19688 conditions per place. [2024-11-10 18:17:20,822 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 44 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2024-11-10 18:17:20,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 277 flow [2024-11-10 18:17:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:17:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:17:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 236 transitions. [2024-11-10 18:17:20,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2024-11-10 18:17:20,825 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 173 flow. Second operand 7 states and 236 transitions. [2024-11-10 18:17:20,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 277 flow [2024-11-10 18:17:20,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 72 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:17:20,826 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 184 flow [2024-11-10 18:17:20,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2024-11-10 18:17:20,827 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, -3 predicate places. [2024-11-10 18:17:20,827 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 184 flow [2024-11-10 18:17:20,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.363636363636363) internal successors, (301), 11 states have internal predecessors, (301), 0 states have call successors, (0), 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-10 18:17:20,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:20,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:20,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:17:21,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:17:21,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:21,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1546964343, now seen corresponding path program 1 times [2024-11-10 18:17:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407045129] [2024-11-10 18:17:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:21,155 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-10 18:17:21,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:21,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407045129] [2024-11-10 18:17:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407045129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:21,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:21,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:17:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554414733] [2024-11-10 18:17:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:21,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:17:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:17:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:17:21,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:21,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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-10 18:17:21,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:21,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:21,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:22,895 INFO L124 PetriNetUnfolderBase]: 15161/20884 cut-off events. [2024-11-10 18:17:22,896 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-10 18:17:22,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40954 conditions, 20884 events. 15161/20884 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 139802 event pairs, 12544 based on Foata normal form. 0/14356 useless extension candidates. Maximal degree in co-relation 40926. Up to 19690 conditions per place. [2024-11-10 18:17:23,186 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 46 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2024-11-10 18:17:23,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 74 transitions, 298 flow [2024-11-10 18:17:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:17:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:17:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-11-10 18:17:23,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-11-10 18:17:23,197 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 184 flow. Second operand 5 states and 194 transitions. [2024-11-10 18:17:23,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 74 transitions, 298 flow [2024-11-10 18:17:23,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 74 transitions, 269 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-10 18:17:23,199 INFO L231 Difference]: Finished difference. Result has 76 places, 74 transitions, 194 flow [2024-11-10 18:17:23,200 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=76, PETRI_TRANSITIONS=74} [2024-11-10 18:17:23,202 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, -4 predicate places. [2024-11-10 18:17:23,202 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 194 flow [2024-11-10 18:17:23,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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-10 18:17:23,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:23,202 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:23,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:17:23,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:23,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash -614858223, now seen corresponding path program 1 times [2024-11-10 18:17:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656309140] [2024-11-10 18:17:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656309140] [2024-11-10 18:17:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656309140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:17:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546252313] [2024-11-10 18:17:23,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:23,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:17:23,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:17:23,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:17:23,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:17:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:23,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 18:17:23,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:17:23,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 18:17:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:23,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:17:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546252313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:17:23,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:17:23,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-10 18:17:23,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71106639] [2024-11-10 18:17:23,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:17:23,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:17:23,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:23,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:17:23,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:17:23,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 84 [2024-11-10 18:17:23,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 194 flow. Second operand has 13 states, 13 states have (on average 27.46153846153846) internal successors, (357), 13 states have internal predecessors, (357), 0 states have call successors, (0), 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-10 18:17:23,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:23,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 84 [2024-11-10 18:17:23,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:25,741 INFO L124 PetriNetUnfolderBase]: 15163/20893 cut-off events. [2024-11-10 18:17:25,742 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-11-10 18:17:25,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40978 conditions, 20893 events. 15163/20893 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 139938 event pairs, 12544 based on Foata normal form. 0/14366 useless extension candidates. Maximal degree in co-relation 40910. Up to 19684 conditions per place. [2024-11-10 18:17:25,835 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 46 selfloop transitions, 18 changer transitions 0/83 dead transitions. [2024-11-10 18:17:25,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 83 transitions, 350 flow [2024-11-10 18:17:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:17:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:17:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 300 transitions. [2024-11-10 18:17:25,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2024-11-10 18:17:25,837 INFO L175 Difference]: Start difference. First operand has 76 places, 74 transitions, 194 flow. Second operand 9 states and 300 transitions. [2024-11-10 18:17:25,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 83 transitions, 350 flow [2024-11-10 18:17:25,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:17:25,839 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 244 flow [2024-11-10 18:17:25,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2024-11-10 18:17:25,844 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 1 predicate places. [2024-11-10 18:17:25,844 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 244 flow [2024-11-10 18:17:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 27.46153846153846) internal successors, (357), 13 states have internal predecessors, (357), 0 states have call successors, (0), 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-10 18:17:25,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:25,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:25,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:17:26,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:17:26,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:26,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1762134595, now seen corresponding path program 1 times [2024-11-10 18:17:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:26,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949355563] [2024-11-10 18:17:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:26,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:26,102 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-10 18:17:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:26,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949355563] [2024-11-10 18:17:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949355563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:17:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862362465] [2024-11-10 18:17:26,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:26,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:17:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:26,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:17:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:17:26,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:26,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:17:26,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:26,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:26,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:27,966 INFO L124 PetriNetUnfolderBase]: 18048/25178 cut-off events. [2024-11-10 18:17:27,966 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-11-10 18:17:28,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49362 conditions, 25178 events. 18048/25178 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 173865 event pairs, 15126 based on Foata normal form. 608/18633 useless extension candidates. Maximal degree in co-relation 40929. Up to 19703 conditions per place. [2024-11-10 18:17:28,115 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 97 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2024-11-10 18:17:28,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 121 transitions, 578 flow [2024-11-10 18:17:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:17:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:17:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2024-11-10 18:17:28,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2024-11-10 18:17:28,118 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 244 flow. Second operand 5 states and 236 transitions. [2024-11-10 18:17:28,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 121 transitions, 578 flow [2024-11-10 18:17:28,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 121 transitions, 525 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-10 18:17:28,123 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 257 flow [2024-11-10 18:17:28,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-11-10 18:17:28,124 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 3 predicate places. [2024-11-10 18:17:28,124 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 257 flow [2024-11-10 18:17:28,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:17:28,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:28,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:28,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:17:28,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:28,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash 62138873, now seen corresponding path program 1 times [2024-11-10 18:17:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:28,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306058965] [2024-11-10 18:17:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:28,200 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-10 18:17:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306058965] [2024-11-10 18:17:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306058965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:28,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:28,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:17:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111753543] [2024-11-10 18:17:28,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:28,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:17:28,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:28,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:17:28,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:17:28,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:28,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:17:28,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:28,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:28,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:29,687 INFO L124 PetriNetUnfolderBase]: 13245/18550 cut-off events. [2024-11-10 18:17:29,687 INFO L125 PetriNetUnfolderBase]: For 1052/1052 co-relation queries the response was YES. [2024-11-10 18:17:29,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39339 conditions, 18550 events. 13245/18550 cut-off events. For 1052/1052 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 124228 event pairs, 10898 based on Foata normal form. 0/13802 useless extension candidates. Maximal degree in co-relation 33105. Up to 17384 conditions per place. [2024-11-10 18:17:29,786 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 53 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2024-11-10 18:17:29,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 369 flow [2024-11-10 18:17:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:17:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:17:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2024-11-10 18:17:29,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2024-11-10 18:17:29,788 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 257 flow. Second operand 4 states and 158 transitions. [2024-11-10 18:17:29,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 369 flow [2024-11-10 18:17:29,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:17:29,792 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 261 flow [2024-11-10 18:17:29,792 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2024-11-10 18:17:29,793 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 3 predicate places. [2024-11-10 18:17:29,793 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 261 flow [2024-11-10 18:17:29,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:17:29,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:29,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:17:29,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:29,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 62138874, now seen corresponding path program 1 times [2024-11-10 18:17:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324729023] [2024-11-10 18:17:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:29,846 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-10 18:17:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:29,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324729023] [2024-11-10 18:17:29,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324729023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:29,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:29,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:17:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17584758] [2024-11-10 18:17:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:29,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:17:29,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:29,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:17:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:17:29,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:29,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-10 18:17:29,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:29,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:29,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:31,642 INFO L124 PetriNetUnfolderBase]: 16856/24279 cut-off events. [2024-11-10 18:17:31,643 INFO L125 PetriNetUnfolderBase]: For 1374/1374 co-relation queries the response was YES. [2024-11-10 18:17:31,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51309 conditions, 24279 events. 16856/24279 cut-off events. For 1374/1374 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 174617 event pairs, 14179 based on Foata normal form. 581/19342 useless extension candidates. Maximal degree in co-relation 43168. Up to 17407 conditions per place. [2024-11-10 18:17:31,801 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 84 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2024-11-10 18:17:31,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 527 flow [2024-11-10 18:17:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:17:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:17:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-11-10 18:17:31,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-10 18:17:31,803 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 261 flow. Second operand 5 states and 224 transitions. [2024-11-10 18:17:31,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 527 flow [2024-11-10 18:17:31,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:17:31,808 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 291 flow [2024-11-10 18:17:31,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2024-11-10 18:17:31,809 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 7 predicate places. [2024-11-10 18:17:31,809 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 291 flow [2024-11-10 18:17:31,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-10 18:17:31,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:31,810 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:31,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:17:31,810 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:31,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1169187859, now seen corresponding path program 1 times [2024-11-10 18:17:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:31,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374881861] [2024-11-10 18:17:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374881861] [2024-11-10 18:17:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374881861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:17:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985850667] [2024-11-10 18:17:32,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:32,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:17:32,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:17:32,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:17:32,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:17:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:32,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 18:17:32,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:17:32,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:17:32,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:17:32,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 18:17:32,503 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 18:17:32,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 18:17:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:32,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:17:32,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985850667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:32,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:17:32,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2024-11-10 18:17:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079720840] [2024-11-10 18:17:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:32,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:17:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:32,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:17:32,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:17:32,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 84 [2024-11-10 18:17:32,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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-10 18:17:32,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:32,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 84 [2024-11-10 18:17:32,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:33,769 INFO L124 PetriNetUnfolderBase]: 12936/18746 cut-off events. [2024-11-10 18:17:33,770 INFO L125 PetriNetUnfolderBase]: For 2187/2187 co-relation queries the response was YES. [2024-11-10 18:17:33,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40937 conditions, 18746 events. 12936/18746 cut-off events. For 2187/2187 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 131593 event pairs, 10753 based on Foata normal form. 0/14995 useless extension candidates. Maximal degree in co-relation 32268. Up to 17299 conditions per place. [2024-11-10 18:17:33,870 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 56 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-10 18:17:33,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 79 transitions, 403 flow [2024-11-10 18:17:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:17:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:17:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-11-10 18:17:33,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-11-10 18:17:33,872 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 291 flow. Second operand 4 states and 150 transitions. [2024-11-10 18:17:33,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 79 transitions, 403 flow [2024-11-10 18:17:33,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 79 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:17:33,877 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 286 flow [2024-11-10 18:17:33,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2024-11-10 18:17:33,878 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 7 predicate places. [2024-11-10 18:17:33,878 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 286 flow [2024-11-10 18:17:33,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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-10 18:17:33,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:33,879 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:33,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 18:17:34,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:17:34,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1169187858, now seen corresponding path program 1 times [2024-11-10 18:17:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558075510] [2024-11-10 18:17:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:17:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558075510] [2024-11-10 18:17:34,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558075510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:34,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:34,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:17:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585533969] [2024-11-10 18:17:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:34,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:17:34,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:17:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:17:34,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:34,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:17:34,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:34,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:34,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:35,141 INFO L124 PetriNetUnfolderBase]: 9642/14095 cut-off events. [2024-11-10 18:17:35,141 INFO L125 PetriNetUnfolderBase]: For 1774/1774 co-relation queries the response was YES. [2024-11-10 18:17:35,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 14095 events. 9642/14095 cut-off events. For 1774/1774 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 96354 event pairs, 7905 based on Foata normal form. 0/12049 useless extension candidates. Maximal degree in co-relation 21365. Up to 12955 conditions per place. [2024-11-10 18:17:35,196 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 46 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-11-10 18:17:35,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 77 transitions, 386 flow [2024-11-10 18:17:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:17:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:17:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-11-10 18:17:35,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-11-10 18:17:35,200 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 286 flow. Second operand 5 states and 182 transitions. [2024-11-10 18:17:35,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 77 transitions, 386 flow [2024-11-10 18:17:35,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:17:35,203 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 289 flow [2024-11-10 18:17:35,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2024-11-10 18:17:35,203 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 7 predicate places. [2024-11-10 18:17:35,203 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 289 flow [2024-11-10 18:17:35,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:17:35,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:35,204 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:35,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:17:35,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:35,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash -413208190, now seen corresponding path program 1 times [2024-11-10 18:17:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:35,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414094031] [2024-11-10 18:17:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:35,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:35,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414094031] [2024-11-10 18:17:35,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414094031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:17:35,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896076996] [2024-11-10 18:17:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:35,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:17:35,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:17:35,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:17:35,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:17:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:35,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 18:17:35,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:17:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:35,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:17:35,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896076996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:35,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:17:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-10 18:17:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805372854] [2024-11-10 18:17:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:35,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:17:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:17:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:17:35,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:35,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 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-10 18:17:35,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:35,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:35,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:36,435 INFO L124 PetriNetUnfolderBase]: 7325/10917 cut-off events. [2024-11-10 18:17:36,436 INFO L125 PetriNetUnfolderBase]: For 1451/1451 co-relation queries the response was YES. [2024-11-10 18:17:36,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22644 conditions, 10917 events. 7325/10917 cut-off events. For 1451/1451 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 73609 event pairs, 5929 based on Foata normal form. 0/9814 useless extension candidates. Maximal degree in co-relation 16101. Up to 9905 conditions per place. [2024-11-10 18:17:36,497 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 47 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2024-11-10 18:17:36,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 75 transitions, 393 flow [2024-11-10 18:17:36,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:17:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:17:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-11-10 18:17:36,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-11-10 18:17:36,499 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 289 flow. Second operand 5 states and 182 transitions. [2024-11-10 18:17:36,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 75 transitions, 393 flow [2024-11-10 18:17:36,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 75 transitions, 381 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:17:36,502 INFO L231 Difference]: Finished difference. Result has 86 places, 75 transitions, 287 flow [2024-11-10 18:17:36,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=86, PETRI_TRANSITIONS=75} [2024-11-10 18:17:36,503 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2024-11-10 18:17:36,503 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 75 transitions, 287 flow [2024-11-10 18:17:36,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 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-10 18:17:36,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:36,504 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:36,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 18:17:36,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:17:36,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:36,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash -331591065, now seen corresponding path program 1 times [2024-11-10 18:17:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:36,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121618297] [2024-11-10 18:17:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:36,893 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-10 18:17:36,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121618297] [2024-11-10 18:17:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121618297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:36,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:17:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160265716] [2024-11-10 18:17:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:36,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:17:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:17:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:17:36,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 84 [2024-11-10 18:17:36,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 75 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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-10 18:17:36,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:36,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 84 [2024-11-10 18:17:36,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:38,038 INFO L124 PetriNetUnfolderBase]: 8366/12403 cut-off events. [2024-11-10 18:17:38,038 INFO L125 PetriNetUnfolderBase]: For 1836/1836 co-relation queries the response was YES. [2024-11-10 18:17:38,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26029 conditions, 12403 events. 8366/12403 cut-off events. For 1836/1836 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 78659 event pairs, 1129 based on Foata normal form. 558/12715 useless extension candidates. Maximal degree in co-relation 22310. Up to 7344 conditions per place. [2024-11-10 18:17:38,099 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 85 selfloop transitions, 6 changer transitions 4/116 dead transitions. [2024-11-10 18:17:38,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 116 transitions, 577 flow [2024-11-10 18:17:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:17:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:17:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-11-10 18:17:38,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2024-11-10 18:17:38,101 INFO L175 Difference]: Start difference. First operand has 86 places, 75 transitions, 287 flow. Second operand 5 states and 226 transitions. [2024-11-10 18:17:38,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 116 transitions, 577 flow [2024-11-10 18:17:38,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 116 transitions, 563 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:17:38,103 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 259 flow [2024-11-10 18:17:38,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2024-11-10 18:17:38,104 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2024-11-10 18:17:38,104 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 259 flow [2024-11-10 18:17:38,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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-10 18:17:38,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:38,105 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:38,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:17:38,105 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1732489529, now seen corresponding path program 1 times [2024-11-10 18:17:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:38,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601201183] [2024-11-10 18:17:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:38,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:17:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601201183] [2024-11-10 18:17:38,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601201183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:38,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:38,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:17:38,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626298744] [2024-11-10 18:17:38,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:38,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:17:38,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:17:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:17:38,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 84 [2024-11-10 18:17:38,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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-10 18:17:38,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:38,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 84 [2024-11-10 18:17:38,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:39,441 INFO L124 PetriNetUnfolderBase]: 10828/16348 cut-off events. [2024-11-10 18:17:39,442 INFO L125 PetriNetUnfolderBase]: For 6584/6880 co-relation queries the response was YES. [2024-11-10 18:17:39,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36492 conditions, 16348 events. 10828/16348 cut-off events. For 6584/6880 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 112878 event pairs, 1548 based on Foata normal form. 480/16721 useless extension candidates. Maximal degree in co-relation 36443. Up to 10166 conditions per place. [2024-11-10 18:17:39,581 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 98 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2024-11-10 18:17:39,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 128 transitions, 636 flow [2024-11-10 18:17:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:17:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:17:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2024-11-10 18:17:39,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-11-10 18:17:39,582 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 259 flow. Second operand 6 states and 270 transitions. [2024-11-10 18:17:39,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 128 transitions, 636 flow [2024-11-10 18:17:39,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 128 transitions, 614 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-10 18:17:39,587 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 306 flow [2024-11-10 18:17:39,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2024-11-10 18:17:39,587 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places. [2024-11-10 18:17:39,588 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 306 flow [2024-11-10 18:17:39,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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-10 18:17:39,588 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:39,588 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:17:39,588 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:39,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash 577531329, now seen corresponding path program 2 times [2024-11-10 18:17:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205618566] [2024-11-10 18:17:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:17:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:17:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205618566] [2024-11-10 18:17:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205618566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:17:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778860606] [2024-11-10 18:17:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:39,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:17:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:17:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:17:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:17:39,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 84 [2024-11-10 18:17:39,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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-10 18:17:39,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:39,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 84 [2024-11-10 18:17:39,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:41,918 INFO L124 PetriNetUnfolderBase]: 19678/29762 cut-off events. [2024-11-10 18:17:41,919 INFO L125 PetriNetUnfolderBase]: For 20927/21445 co-relation queries the response was YES. [2024-11-10 18:17:42,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72737 conditions, 29762 events. 19678/29762 cut-off events. For 20927/21445 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 223630 event pairs, 5841 based on Foata normal form. 332/29427 useless extension candidates. Maximal degree in co-relation 72687. Up to 12488 conditions per place. [2024-11-10 18:17:42,264 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 115 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2024-11-10 18:17:42,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 147 transitions, 758 flow [2024-11-10 18:17:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:17:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:17:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 283 transitions. [2024-11-10 18:17:42,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5615079365079365 [2024-11-10 18:17:42,266 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 306 flow. Second operand 6 states and 283 transitions. [2024-11-10 18:17:42,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 147 transitions, 758 flow [2024-11-10 18:17:42,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 147 transitions, 744 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-10 18:17:42,335 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 382 flow [2024-11-10 18:17:42,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2024-11-10 18:17:42,336 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2024-11-10 18:17:42,336 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 382 flow [2024-11-10 18:17:42,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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-10 18:17:42,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:42,337 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:42,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 18:17:42,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:42,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -724527609, now seen corresponding path program 3 times [2024-11-10 18:17:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:17:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784737488] [2024-11-10 18:17:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:17:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:17:42,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:17:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:17:42,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:17:42,407 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:17:42,408 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-10 18:17:42,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-10 18:17:42,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-10 18:17:42,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-10 18:17:42,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-10 18:17:42,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-10 18:17:42,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-10 18:17:42,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-10 18:17:42,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-10 18:17:42,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-10 18:17:42,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-10 18:17:42,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2024-11-10 18:17:42,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2024-11-10 18:17:42,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2024-11-10 18:17:42,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2024-11-10 18:17:42,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2024-11-10 18:17:42,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-10 18:17:42,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-10 18:17:42,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-10 18:17:42,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-10 18:17:42,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-10 18:17:42,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-10 18:17:42,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-10 18:17:42,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-10 18:17:42,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-10 18:17:42,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2024-11-10 18:17:42,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:17:42,413 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:42,484 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:17:42,484 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:17:42,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:17:42 BasicIcfg [2024-11-10 18:17:42,492 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:17:42,492 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:17:42,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:17:42,492 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:17:42,493 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:17:11" (3/4) ... [2024-11-10 18:17:42,498 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:17:42,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:17:42,500 INFO L158 Benchmark]: Toolchain (without parser) took 32212.30ms. Allocated memory was 228.6MB in the beginning and 13.5GB in the end (delta: 13.3GB). Free memory was 157.5MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-10 18:17:42,500 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:17:42,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.58ms. Allocated memory is still 228.6MB. Free memory was 157.3MB in the beginning and 142.3MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 18:17:42,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.52ms. Allocated memory is still 228.6MB. Free memory was 142.3MB in the beginning and 139.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:17:42,500 INFO L158 Benchmark]: Boogie Preprocessor took 57.75ms. Allocated memory is still 228.6MB. Free memory was 139.7MB in the beginning and 136.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:17:42,501 INFO L158 Benchmark]: IcfgBuilder took 1123.49ms. Allocated memory is still 228.6MB. Free memory was 136.6MB in the beginning and 119.4MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 18:17:42,501 INFO L158 Benchmark]: TraceAbstraction took 30613.78ms. Allocated memory was 228.6MB in the beginning and 13.5GB in the end (delta: 13.3GB). Free memory was 119.4MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-10 18:17:42,501 INFO L158 Benchmark]: Witness Printer took 7.17ms. Allocated memory is still 13.5GB. Free memory was 10.6GB in the beginning and 10.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:17:42,502 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.58ms. Allocated memory is still 228.6MB. Free memory was 157.3MB in the beginning and 142.3MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.52ms. Allocated memory is still 228.6MB. Free memory was 142.3MB in the beginning and 139.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.75ms. Allocated memory is still 228.6MB. Free memory was 139.7MB in the beginning and 136.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1123.49ms. Allocated memory is still 228.6MB. Free memory was 136.6MB in the beginning and 119.4MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30613.78ms. Allocated memory was 228.6MB in the beginning and 13.5GB in the end (delta: 13.3GB). Free memory was 119.4MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 7.17ms. Allocated memory is still 13.5GB. Free memory was 10.6GB in the beginning and 10.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L40] 0 int* q1; [L41] 0 int* q2; [L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2; [L124] 0 pthread_t t1, t2, t3, t4; [L126] 0 C = __VERIFIER_nondet_int() [L127] 0 M = __VERIFIER_nondet_int() [L128] 0 N = __VERIFIER_nondet_int() [L130] 0 q1_front = __VERIFIER_nondet_int() [L131] 0 q1_back = __VERIFIER_nondet_int() [L132] 0 q2_front = __VERIFIER_nondet_int() [L133] 0 q2_back = __VERIFIER_nondet_int() [L135] 0 n1 = __VERIFIER_nondet_int() [L136] 0 n2 = __VERIFIER_nondet_int() [L137] CALL, EXPR 0 create_fresh_int_array(n1) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND TRUE 0 i < size [L165] 0 arr[i] = __VERIFIER_nondet_int() [L164] 0 i++ VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND FALSE 0 !(i < size) VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L167] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n1) [L137] 0 q1 = create_fresh_int_array(n1) [L138] CALL, EXPR 0 create_fresh_int_array(n2) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=0, arr={-3:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L164] COND FALSE 0 !(i < size) VAL [C=3, M=0, N=1, \old(size)=0, arr={-3:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L167] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n2) [L138] 0 q2 = create_fresh_int_array(n2) [L140] CALL 0 assume_abort_if_not(C > -2147483648) [L37] COND FALSE 0 !(!cond) [L140] RET 0 assume_abort_if_not(C > -2147483648) [L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L37] COND FALSE 0 !(!cond) [L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, total=0] [L49] 1 _Bool cond = i < N; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1[q1_back] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L37] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L54] 1 i++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, total=0] [L69] 2 _Bool cond = j < M; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L84] 2 return 0; [L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, total=0] [L89] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L91] COND FALSE 3 !(\read(cond)) VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L107] 4 _Bool cond = j < M || q2_front < q2_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L120] 4 return 0; [L102] 3 return 0; [L57] 1 q1_back++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L60] 1 cond = i < N VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L64] 1 return 0; [L148] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L149] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L150] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L151] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L153] CALL 0 assume_abort_if_not(total <= 0) [L37] COND FALSE 0 !(!cond) [L153] RET 0 assume_abort_if_not(total <= 0) [L154] CALL 0 reach_error() [L21] 0 __assert_fail("0", "popl20-bad-buffer-mult-alt.wvr.c", 21, __extension__ __PRETTY_FUNCTION__) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] - 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: 123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 147]: 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: 146]: 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: 144]: 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: 145]: 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: -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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 119 locations, 26 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: 30.4s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 736 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2432 IncrementalHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 18 mSDtfsCounter, 2432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=14, InterpolantAutomatonStates: 73, 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.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 312 ConstructedInterpolants, 1 QuantifiedInterpolants, 2712 SizeOfPredicates, 15 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 16/36 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-10 18:17:42,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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/weaver/popl20-bad-buffer-mult-alt3.wvr.c -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 fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:17:45,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:17:45,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:17:45,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:17:45,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:17:45,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:17:45,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:17:45,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:17:45,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:17:45,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:17:45,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:17:45,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:17:45,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:17:45,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:17:45,275 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:17:45,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:17:45,275 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:17:45,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:17:45,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:17:45,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:17:45,276 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:17:45,277 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:17:45,277 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:17:45,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:17:45,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:17:45,278 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:17:45,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:17:45,278 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:17:45,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:17:45,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:17:45,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:17:45,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:17:45,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:17:45,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:17:45,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:17:45,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:17:45,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:17:45,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:17:45,280 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:17:45,281 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:17:45,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:17:45,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:17:45,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:17:45,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:17:45,282 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2024-11-10 18:17:45,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:17:45,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:17:45,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:17:45,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:17:45,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:17:45,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-10 18:17:47,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:17:47,221 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:17:47,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-10 18:17:47,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89adfb9c8/cddedd45744d45a389b0043e152642c0/FLAG76f514127 [2024-11-10 18:17:47,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89adfb9c8/cddedd45744d45a389b0043e152642c0 [2024-11-10 18:17:47,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:17:47,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:17:47,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:17:47,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:17:47,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:17:47,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aee09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47, skipping insertion in model container [2024-11-10 18:17:47,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:17:47,508 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:17:47,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:17:47,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:17:47,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:17:47,584 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:17:47,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47 WrapperNode [2024-11-10 18:17:47,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:17:47,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:17:47,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:17:47,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:17:47,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,638 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 294 [2024-11-10 18:17:47,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:17:47,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:17:47,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:17:47,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:17:47,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,681 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-10 18:17:47,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:17:47,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:17:47,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:17:47,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:17:47,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (1/1) ... [2024-11-10 18:17:47,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:17:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:17:47,752 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-10 18:17:47,758 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-10 18:17:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:17:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:17:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 18:17:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 18:17:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 18:17:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 18:17:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 18:17:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 18:17:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 18:17:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 18:17:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 18:17:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-10 18:17:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-10 18:17:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:17:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:17:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:17:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:17:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:17:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 18:17:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 18:17:47,796 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:17:47,938 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:17:47,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:17:48,443 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:17:48,444 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:17:48,736 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:17:48,736 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:17:48,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:17:48 BoogieIcfgContainer [2024-11-10 18:17:48,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:17:48,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:17:48,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:17:48,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:17:48,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:17:47" (1/3) ... [2024-11-10 18:17:48,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d35fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:17:48, skipping insertion in model container [2024-11-10 18:17:48,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:47" (2/3) ... [2024-11-10 18:17:48,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d35fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:17:48, skipping insertion in model container [2024-11-10 18:17:48,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:17:48" (3/3) ... [2024-11-10 18:17:48,742 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-10 18:17:48,757 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:17:48,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-10 18:17:48,758 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:17:48,814 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-10 18:17:48,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 196 flow [2024-11-10 18:17:48,863 INFO L124 PetriNetUnfolderBase]: 12/80 cut-off events. [2024-11-10 18:17:48,863 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 18:17:48,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 80 events. 12/80 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 199 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2024-11-10 18:17:48,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 84 transitions, 196 flow [2024-11-10 18:17:48,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 79 transitions, 182 flow [2024-11-10 18:17:48,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:17:48,881 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;@88131b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:17:48,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-10 18:17:48,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:17:48,884 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2024-11-10 18:17:48,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:17:48,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:48,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:17:48,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:48,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 24576303, now seen corresponding path program 1 times [2024-11-10 18:17:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:17:48,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368762260] [2024-11-10 18:17:48,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:48,900 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-10 18:17:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:17:48,903 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-10 18:17:48,904 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-10 18:17:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:48,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:17:48,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:17:49,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:17:49,048 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-10 18:17:49,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:17:49,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:17:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368762260] [2024-11-10 18:17:49,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368762260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:49,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:49,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:17:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529946622] [2024-11-10 18:17:49,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:49,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:17:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:17:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:17:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:17:49,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:49,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-10 18:17:49,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:49,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:49,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:51,208 INFO L124 PetriNetUnfolderBase]: 15159/20731 cut-off events. [2024-11-10 18:17:51,209 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2024-11-10 18:17:51,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41422 conditions, 20731 events. 15159/20731 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 1484. Compared 138065 event pairs, 12544 based on Foata normal form. 2616/16759 useless extension candidates. Maximal degree in co-relation 38836. Up to 19683 conditions per place. [2024-11-10 18:17:51,378 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 44 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-11-10 18:17:51,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 254 flow [2024-11-10 18:17:51,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:17:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:17:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-11-10 18:17:51,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2024-11-10 18:17:51,390 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 182 flow. Second operand 3 states and 139 transitions. [2024-11-10 18:17:51,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 254 flow [2024-11-10 18:17:51,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 238 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-10 18:17:51,685 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 150 flow [2024-11-10 18:17:51,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2024-11-10 18:17:51,694 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, -10 predicate places. [2024-11-10 18:17:51,697 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 150 flow [2024-11-10 18:17:51,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-10 18:17:51,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:51,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:17:51,709 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-10 18:17:51,898 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-10 18:17:51,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:51,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 24576304, now seen corresponding path program 1 times [2024-11-10 18:17:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:17:51,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51599556] [2024-11-10 18:17:51,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:51,902 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-10 18:17:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:17:51,905 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-10 18:17:51,918 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-10 18:17:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:52,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:17:52,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:17:52,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-10 18:17:52,246 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-10 18:17:52,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:17:52,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:17:52,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51599556] [2024-11-10 18:17:52,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51599556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:52,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:17:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339788332] [2024-11-10 18:17:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:52,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:17:52,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:17:52,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:17:52,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:17:52,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:52,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-10 18:17:52,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:52,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:52,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:54,144 INFO L124 PetriNetUnfolderBase]: 15161/20741 cut-off events. [2024-11-10 18:17:54,145 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-10 18:17:54,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40794 conditions, 20741 events. 15161/20741 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 1484. Compared 137924 event pairs, 12544 based on Foata normal form. 0/14151 useless extension candidates. Maximal degree in co-relation 40750. Up to 19692 conditions per place. [2024-11-10 18:17:54,413 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 47 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2024-11-10 18:17:54,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 272 flow [2024-11-10 18:17:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:17:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:17:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-11-10 18:17:54,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 18:17:54,416 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 150 flow. Second operand 4 states and 168 transitions. [2024-11-10 18:17:54,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 272 flow [2024-11-10 18:17:54,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:17:54,418 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 202 flow [2024-11-10 18:17:54,419 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2024-11-10 18:17:54,419 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2024-11-10 18:17:54,420 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 202 flow [2024-11-10 18:17:54,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-10 18:17:54,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:54,420 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2024-11-10 18:17:54,428 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 (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:17:54,622 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-10 18:17:54,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:54,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2009035230, now seen corresponding path program 1 times [2024-11-10 18:17:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:17:54,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136417270] [2024-11-10 18:17:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:54,625 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-10 18:17:54,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:17:54,631 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-10 18:17:54,634 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-10 18:17:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:54,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 18:17:54,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:17:54,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-10 18:17:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:54,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:17:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:17:55,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:17:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136417270] [2024-11-10 18:17:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136417270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:17:55,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:17:55,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-10 18:17:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607929340] [2024-11-10 18:17:55,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:17:55,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:17:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:17:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:17:55,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:17:55,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 84 [2024-11-10 18:17:55,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 202 flow. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 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-10 18:17:55,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:55,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 84 [2024-11-10 18:17:55,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:17:57,681 INFO L124 PetriNetUnfolderBase]: 15167/20769 cut-off events. [2024-11-10 18:17:57,681 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-11-10 18:17:57,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40887 conditions, 20769 events. 15167/20769 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 1484. Compared 137989 event pairs, 12544 based on Foata normal form. 0/14179 useless extension candidates. Maximal degree in co-relation 40767. Up to 19694 conditions per place. [2024-11-10 18:17:57,857 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 52 selfloop transitions, 28 changer transitions 0/99 dead transitions. [2024-11-10 18:17:57,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 99 transitions, 446 flow [2024-11-10 18:17:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:17:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 18:17:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 372 transitions. [2024-11-10 18:17:57,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2024-11-10 18:17:57,866 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 202 flow. Second operand 11 states and 372 transitions. [2024-11-10 18:17:57,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 99 transitions, 446 flow [2024-11-10 18:17:57,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:17:57,870 INFO L231 Difference]: Finished difference. Result has 89 places, 95 transitions, 389 flow [2024-11-10 18:17:57,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=389, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2024-11-10 18:17:57,871 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places. [2024-11-10 18:17:57,871 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 389 flow [2024-11-10 18:17:57,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 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-10 18:17:57,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:17:57,872 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:17:57,876 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-10 18:17:58,073 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-10 18:17:58,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:17:58,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:17:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash -783647166, now seen corresponding path program 1 times [2024-11-10 18:17:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:17:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428364093] [2024-11-10 18:17:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:17:58,077 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-10 18:17:58,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:17:58,079 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-10 18:17:58,081 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-10 18:17:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:17:58,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:17:58,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:17:58,231 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-10 18:17:58,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:17:58,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:17:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428364093] [2024-11-10 18:17:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428364093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:17:58,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:17:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:17:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486361649] [2024-11-10 18:17:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:17:58,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:17:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:17:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:17:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:17:58,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:17:58,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 95 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:17:58,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:17:58,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:17:58,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:18:00,624 INFO L124 PetriNetUnfolderBase]: 18054/25208 cut-off events. [2024-11-10 18:18:00,624 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2024-11-10 18:18:00,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49513 conditions, 25208 events. 18054/25208 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 1622. Compared 174790 event pairs, 15126 based on Foata normal form. 608/18662 useless extension candidates. Maximal degree in co-relation 49419. Up to 19717 conditions per place. [2024-11-10 18:18:00,832 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 118 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2024-11-10 18:18:00,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 143 transitions, 826 flow [2024-11-10 18:18:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:18:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:18:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2024-11-10 18:18:00,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-11-10 18:18:00,834 INFO L175 Difference]: Start difference. First operand has 89 places, 95 transitions, 389 flow. Second operand 5 states and 232 transitions. [2024-11-10 18:18:00,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 143 transitions, 826 flow [2024-11-10 18:18:00,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 143 transitions, 739 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-11-10 18:18:00,839 INFO L231 Difference]: Finished difference. Result has 91 places, 96 transitions, 362 flow [2024-11-10 18:18:00,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=91, PETRI_TRANSITIONS=96} [2024-11-10 18:18:00,840 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 11 predicate places. [2024-11-10 18:18:00,840 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 96 transitions, 362 flow [2024-11-10 18:18:00,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:18:00,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:18:00,840 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:18:00,845 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-10 18:18:01,041 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-10 18:18:01,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:18:01,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:18:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash -965285642, now seen corresponding path program 1 times [2024-11-10 18:18:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:18:01,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062424901] [2024-11-10 18:18:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:18:01,042 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-10 18:18:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:18:01,045 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-10 18:18:01,046 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-10 18:18:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:18:01,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:18:01,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:18:01,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:18:01,132 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-10 18:18:01,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:18:01,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:18:01,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062424901] [2024-11-10 18:18:01,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062424901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:18:01,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:18:01,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:18:01,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128348590] [2024-11-10 18:18:01,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:18:01,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:18:01,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:18:01,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:18:01,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:18:01,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:18:01,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 96 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:18:01,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:18:01,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:18:01,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:18:02,866 INFO L124 PetriNetUnfolderBase]: 13251/18580 cut-off events. [2024-11-10 18:18:02,866 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2024-11-10 18:18:02,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39461 conditions, 18580 events. 13251/18580 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 125002 event pairs, 10898 based on Foata normal form. 0/13830 useless extension candidates. Maximal degree in co-relation 39378. Up to 17386 conditions per place. [2024-11-10 18:18:03,056 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 61 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2024-11-10 18:18:03,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 94 transitions, 490 flow [2024-11-10 18:18:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:18:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:18:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2024-11-10 18:18:03,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2024-11-10 18:18:03,058 INFO L175 Difference]: Start difference. First operand has 91 places, 96 transitions, 362 flow. Second operand 4 states and 158 transitions. [2024-11-10 18:18:03,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 94 transitions, 490 flow [2024-11-10 18:18:03,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 482 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 18:18:03,067 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 360 flow [2024-11-10 18:18:03,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2024-11-10 18:18:03,068 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 11 predicate places. [2024-11-10 18:18:03,069 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 360 flow [2024-11-10 18:18:03,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:18:03,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:18:03,070 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:18:03,074 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-10 18:18:03,270 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-10 18:18:03,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:18:03,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:18:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash -965285641, now seen corresponding path program 1 times [2024-11-10 18:18:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:18:03,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699913592] [2024-11-10 18:18:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:18:03,273 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-10 18:18:03,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:18:03,277 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-10 18:18:03,280 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-10 18:18:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:18:03,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:18:03,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:18:03,399 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-10 18:18:03,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:18:03,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:18:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699913592] [2024-11-10 18:18:03,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699913592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:18:03,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:18:03,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:18:03,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202486984] [2024-11-10 18:18:03,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:18:03,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:18:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:18:03,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:18:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:18:03,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:18:03,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-10 18:18:03,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:18:03,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:18:03,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:18:05,780 INFO L124 PetriNetUnfolderBase]: 16862/24309 cut-off events. [2024-11-10 18:18:05,780 INFO L125 PetriNetUnfolderBase]: For 1442/1442 co-relation queries the response was YES. [2024-11-10 18:18:05,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51436 conditions, 24309 events. 16862/24309 cut-off events. For 1442/1442 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 174867 event pairs, 14179 based on Foata normal form. 581/19367 useless extension candidates. Maximal degree in co-relation 51350. Up to 17427 conditions per place. [2024-11-10 18:18:05,896 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 97 selfloop transitions, 7 changer transitions 0/125 dead transitions. [2024-11-10 18:18:05,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 125 transitions, 654 flow [2024-11-10 18:18:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:18:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:18:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-11-10 18:18:05,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-10 18:18:05,898 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 360 flow. Second operand 5 states and 224 transitions. [2024-11-10 18:18:05,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 125 transitions, 654 flow [2024-11-10 18:18:05,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 125 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:18:05,902 INFO L231 Difference]: Finished difference. Result has 94 places, 95 transitions, 384 flow [2024-11-10 18:18:05,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=384, PETRI_PLACES=94, PETRI_TRANSITIONS=95} [2024-11-10 18:18:05,903 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 14 predicate places. [2024-11-10 18:18:05,903 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 95 transitions, 384 flow [2024-11-10 18:18:05,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-10 18:18:05,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:18:05,904 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2024-11-10 18:18:05,907 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 (7)] Forceful destruction successful, exit code 0 [2024-11-10 18:18:06,106 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-10 18:18:06,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:18:06,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:18:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash -998161488, now seen corresponding path program 2 times [2024-11-10 18:18:06,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:18:06,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106018599] [2024-11-10 18:18:06,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:18:06,108 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-10 18:18:06,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:18:06,109 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-10 18:18:06,110 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-10 18:18:06,178 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:18:06,178 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:18:06,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 18:18:06,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:18:06,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-10 18:18:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:18:06,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:18:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:18:06,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:18:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106018599] [2024-11-10 18:18:06,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106018599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:18:06,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:18:06,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-10 18:18:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141441615] [2024-11-10 18:18:06,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:18:06,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 18:18:06,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:18:06,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 18:18:06,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-10 18:18:07,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 84 [2024-11-10 18:18:07,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 384 flow. Second operand has 14 states, 14 states have (on average 27.571428571428573) internal successors, (386), 14 states have internal predecessors, (386), 0 states have call successors, (0), 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-10 18:18:07,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:18:07,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 84 [2024-11-10 18:18:07,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:18:17,261 INFO L124 PetriNetUnfolderBase]: 16880/24399 cut-off events. [2024-11-10 18:18:17,262 INFO L125 PetriNetUnfolderBase]: For 2855/2855 co-relation queries the response was YES. [2024-11-10 18:18:17,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54450 conditions, 24399 events. 16880/24399 cut-off events. For 2855/2855 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 177104 event pairs, 14179 based on Foata normal form. 18/18454 useless extension candidates. Maximal degree in co-relation 54071. Up to 22446 conditions per place. [2024-11-10 18:18:17,495 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 64 selfloop transitions, 62 changer transitions 0/145 dead transitions. [2024-11-10 18:18:17,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 145 transitions, 910 flow [2024-11-10 18:18:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 18:18:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-10 18:18:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 710 transitions. [2024-11-10 18:18:17,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3841991341991342 [2024-11-10 18:18:17,500 INFO L175 Difference]: Start difference. First operand has 94 places, 95 transitions, 384 flow. Second operand 22 states and 710 transitions. [2024-11-10 18:18:17,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 145 transitions, 910 flow [2024-11-10 18:18:17,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 145 transitions, 895 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-10 18:18:17,512 INFO L231 Difference]: Finished difference. Result has 121 places, 133 transitions, 776 flow [2024-11-10 18:18:17,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=776, PETRI_PLACES=121, PETRI_TRANSITIONS=133} [2024-11-10 18:18:17,513 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 41 predicate places. [2024-11-10 18:18:17,513 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 133 transitions, 776 flow [2024-11-10 18:18:17,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 27.571428571428573) internal successors, (386), 14 states have internal predecessors, (386), 0 states have call successors, (0), 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-10 18:18:17,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:18:17,514 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:18:17,520 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-10 18:18:17,716 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-10 18:18:17,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:18:17,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:18:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash 392884564, now seen corresponding path program 1 times [2024-11-10 18:18:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:18:17,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672039753] [2024-11-10 18:18:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:18:17,717 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-10 18:18:17,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:18:17,719 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-10 18:18:17,721 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-10 18:18:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:18:17,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:18:17,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:18:17,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:18:17,815 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 18:18:17,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 18:18:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:18:17,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:18:17,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:18:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672039753] [2024-11-10 18:18:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672039753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:18:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:18:17,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:18:17,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270563052] [2024-11-10 18:18:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:18:17,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:18:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:18:17,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:18:17,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:18:17,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 84 [2024-11-10 18:18:17,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 133 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:18:17,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:18:17,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 84 [2024-11-10 18:18:17,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:18:19,188 INFO L124 PetriNetUnfolderBase]: 12960/18866 cut-off events. [2024-11-10 18:18:19,189 INFO L125 PetriNetUnfolderBase]: For 2613/2613 co-relation queries the response was YES. [2024-11-10 18:18:19,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41473 conditions, 18866 events. 12960/18866 cut-off events. For 2613/2613 co-relation queries the response was YES. Maximal size of possible extension queue 968. Compared 133131 event pairs, 10753 based on Foata normal form. 0/15111 useless extension candidates. Maximal degree in co-relation 41346. Up to 17292 conditions per place. [2024-11-10 18:18:19,432 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 79 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2024-11-10 18:18:19,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 131 transitions, 968 flow [2024-11-10 18:18:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:18:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:18:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2024-11-10 18:18:19,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-11-10 18:18:19,434 INFO L175 Difference]: Start difference. First operand has 121 places, 133 transitions, 776 flow. Second operand 5 states and 184 transitions. [2024-11-10 18:18:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 131 transitions, 968 flow [2024-11-10 18:18:19,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 131 transitions, 871 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-11-10 18:18:19,443 INFO L231 Difference]: Finished difference. Result has 116 places, 131 transitions, 713 flow [2024-11-10 18:18:19,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=713, PETRI_PLACES=116, PETRI_TRANSITIONS=131} [2024-11-10 18:18:19,444 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 36 predicate places. [2024-11-10 18:18:19,446 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 131 transitions, 713 flow [2024-11-10 18:18:19,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10 18:18:19,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:18:19,446 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:18:19,452 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 (9)] Ended with exit code 0 [2024-11-10 18:18:19,649 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-10 18:18:19,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:18:19,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:18:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 392884565, now seen corresponding path program 1 times [2024-11-10 18:18:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:18:19,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500485719] [2024-11-10 18:18:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:18:19,651 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-10 18:18:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:18:19,654 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-10 18:18:19,655 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-10 18:18:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:18:19,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 18:18:19,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:18:19,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:18:19,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-10 18:18:19,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:18:19,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 18:18:20,006 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:18:20,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:18:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:18:20,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:18:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:18:21,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:18:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500485719] [2024-11-10 18:18:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500485719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:18:21,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:18:21,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-11-10 18:18:21,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524272672] [2024-11-10 18:18:21,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:18:21,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:18:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:18:21,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:18:21,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:18:21,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 84 [2024-11-10 18:18:21,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 131 transitions, 713 flow. Second operand has 12 states, 12 states have (on average 25.666666666666668) internal successors, (308), 12 states have internal predecessors, (308), 0 states have call successors, (0), 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-10 18:18:21,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:18:21,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 84 [2024-11-10 18:18:21,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:18:30,260 INFO L124 PetriNetUnfolderBase]: 16638/24273 cut-off events. [2024-11-10 18:18:30,261 INFO L125 PetriNetUnfolderBase]: For 3794/3794 co-relation queries the response was YES. [2024-11-10 18:18:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52240 conditions, 24273 events. 16638/24273 cut-off events. For 3794/3794 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 174818 event pairs, 13396 based on Foata normal form. 0/21083 useless extension candidates. Maximal degree in co-relation 52084. Up to 13000 conditions per place. [2024-11-10 18:18:30,594 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 94 selfloop transitions, 89 changer transitions 0/202 dead transitions. [2024-11-10 18:18:30,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 202 transitions, 1469 flow [2024-11-10 18:18:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 18:18:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-10 18:18:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 484 transitions. [2024-11-10 18:18:30,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3601190476190476 [2024-11-10 18:18:30,602 INFO L175 Difference]: Start difference. First operand has 116 places, 131 transitions, 713 flow. Second operand 16 states and 484 transitions. [2024-11-10 18:18:30,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 202 transitions, 1469 flow [2024-11-10 18:18:30,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 202 transitions, 1427 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:18:30,628 INFO L231 Difference]: Finished difference. Result has 128 places, 168 transitions, 1186 flow [2024-11-10 18:18:30,628 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1186, PETRI_PLACES=128, PETRI_TRANSITIONS=168} [2024-11-10 18:18:30,630 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 48 predicate places. [2024-11-10 18:18:30,630 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 168 transitions, 1186 flow [2024-11-10 18:18:30,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.666666666666668) internal successors, (308), 12 states have internal predecessors, (308), 0 states have call successors, (0), 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-10 18:18:30,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:18:30,635 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:18:30,639 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-10 18:18:30,835 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-10 18:18:30,835 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-10 18:18:30,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:18:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash 248333957, now seen corresponding path program 1 times [2024-11-10 18:18:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:18:30,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530311663] [2024-11-10 18:18:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:18:30,836 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-10 18:18:30,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:18:30,838 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-10 18:18:30,840 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-10 18:18:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:18:30,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 18:18:30,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:18:30,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-10 18:18:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:18:31,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:18:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:18:32,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:18:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530311663] [2024-11-10 18:18:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530311663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:18:32,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:18:32,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-10 18:18:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200360630] [2024-11-10 18:18:32,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:18:32,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:18:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:18:32,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:18:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:18:32,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 84 [2024-11-10 18:18:32,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 168 transitions, 1186 flow. Second operand has 12 states, 12 states have (on average 27.833333333333332) internal successors, (334), 12 states have internal predecessors, (334), 0 states have call successors, (0), 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-10 18:18:32,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:18:32,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 84 [2024-11-10 18:18:32,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand