./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-09 10:50:34,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:50:34,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:50:34,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:50:34,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:50:34,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:50:34,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:50:34,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:50:34,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:50:34,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:50:34,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:50:34,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:50:34,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:50:34,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:50:34,981 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:50:34,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:50:34,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:50:34,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:50:34,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:50:34,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:50:34,983 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:50:34,987 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:50:34,988 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:50:34,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:50:34,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:50:34,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:50:34,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:50:34,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:50:34,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:50:34,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:50:34,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:50:34,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:50:34,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:50:34,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:50:34,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:50:34,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:50:34,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:50:34,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:50:34,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:50:34,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:50:34,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:50:34,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:50:34,997 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-09 10:50:35,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:50:35,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:50:35,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:50:35,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:50:35,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:50:35,302 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-09 10:50:36,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:50:37,109 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:50:37,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-09 10:50:37,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40dc1abf3/ae4e142616f640fb8cb4ff52aa3686ee/FLAG81c376e17 [2024-11-09 10:50:37,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40dc1abf3/ae4e142616f640fb8cb4ff52aa3686ee [2024-11-09 10:50:37,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:50:37,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:50:37,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:50:37,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:50:37,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:50:37,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330b9862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37, skipping insertion in model container [2024-11-09 10:50:37,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:50:37,379 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:50:37,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:50:37,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:50:37,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:50:37,446 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:50:37,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37 WrapperNode [2024-11-09 10:50:37,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:50:37,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:50:37,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:50:37,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:50:37,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,500 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 313 [2024-11-09 10:50:37,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:50:37,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:50:37,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:50:37,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:50:37,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,542 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-09 10:50:37,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:50:37,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:50:37,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:50:37,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:50:37,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (1/1) ... [2024-11-09 10:50:37,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:50:37,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:37,613 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-09 10:50:37,619 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-09 10:50:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:50:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:50:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:50:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:50:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:50:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:50:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:50:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 10:50:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 10:50:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:50:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:50:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:50:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:50:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:50:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:50:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:50:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:50:37,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:50:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:50:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:50:37,669 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:50:37,840 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:50:37,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:50:38,486 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:50:38,487 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:50:38,919 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:50:38,922 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 10:50:38,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:50:38 BoogieIcfgContainer [2024-11-09 10:50:38,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:50:38,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:50:38,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:50:38,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:50:38,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:50:37" (1/3) ... [2024-11-09 10:50:38,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7000f16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:50:38, skipping insertion in model container [2024-11-09 10:50:38,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:37" (2/3) ... [2024-11-09 10:50:38,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7000f16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:50:38, skipping insertion in model container [2024-11-09 10:50:38,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:50:38" (3/3) ... [2024-11-09 10:50:38,935 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-09 10:50:38,955 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:50:38,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-09 10:50:38,956 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:50:39,044 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:50:39,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-09 10:50:39,135 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-09 10:50:39,135 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:50:39,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 155 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-09 10:50:39,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-09 10:50:39,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-09 10:50:39,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:50:39,171 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;@21a84f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:50:39,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-09 10:50:39,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:50:39,179 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:50:39,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:50:39,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:39,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:50:39,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash 892478, now seen corresponding path program 1 times [2024-11-09 10:50:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:39,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933549373] [2024-11-09 10:50:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:39,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:39,561 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-09 10:50:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933549373] [2024-11-09 10:50:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933549373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:39,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:39,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:50:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664469870] [2024-11-09 10:50:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:39,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:50:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:50:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:50:39,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:39,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:39,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:39,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:39,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:41,518 INFO L124 PetriNetUnfolderBase]: 9651/13484 cut-off events. [2024-11-09 10:50:41,518 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2024-11-09 10:50:41,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26018 conditions, 13484 events. 9651/13484 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88202 event pairs, 6408 based on Foata normal form. 1/7906 useless extension candidates. Maximal degree in co-relation 24428. Up to 11896 conditions per place. [2024-11-09 10:50:41,670 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-09 10:50:41,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-09 10:50:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:50:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:50:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-09 10:50:41,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-09 10:50:41,689 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-09 10:50:41,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-09 10:50:41,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:50:41,713 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-09 10:50:41,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-11-09 10:50:41,722 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-09 10:50:41,723 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-09 10:50:41,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:41,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:41,724 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:50:41,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:50:41,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 892479, now seen corresponding path program 1 times [2024-11-09 10:50:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289265435] [2024-11-09 10:50:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:42,098 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-09 10:50:42,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:42,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289265435] [2024-11-09 10:50:42,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289265435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:42,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:42,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:50:42,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432534299] [2024-11-09 10:50:42,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:42,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:50:42,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:42,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:50:42,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:50:42,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:42,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:42,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:42,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:42,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:43,897 INFO L124 PetriNetUnfolderBase]: 9652/13487 cut-off events. [2024-11-09 10:50:43,898 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-09 10:50:43,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25621 conditions, 13487 events. 9652/13487 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88350 event pairs, 6408 based on Foata normal form. 0/7906 useless extension candidates. Maximal degree in co-relation 25592. Up to 11905 conditions per place. [2024-11-09 10:50:44,024 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-11-09 10:50:44,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 218 flow [2024-11-09 10:50:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:50:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:50:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-09 10:50:44,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-09 10:50:44,027 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 140 transitions. [2024-11-09 10:50:44,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 218 flow [2024-11-09 10:50:44,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:44,030 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2024-11-09 10:50:44,030 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2024-11-09 10:50:44,031 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-11-09 10:50:44,031 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2024-11-09 10:50:44,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:44,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:44,032 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:50:44,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:50:44,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:44,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash 27668907, now seen corresponding path program 1 times [2024-11-09 10:50:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:44,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694758663] [2024-11-09 10:50:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:44,257 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-09 10:50:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:44,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694758663] [2024-11-09 10:50:44,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694758663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:44,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:44,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:50:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765492143] [2024-11-09 10:50:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:44,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:44,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:44,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:44,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:50:44,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:44,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 10:50:44,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:44,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:44,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:46,007 INFO L124 PetriNetUnfolderBase]: 9653/13490 cut-off events. [2024-11-09 10:50:46,007 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-09 10:50:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25638 conditions, 13490 events. 9653/13490 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88382 event pairs, 6408 based on Foata normal form. 0/7908 useless extension candidates. Maximal degree in co-relation 25613. Up to 11904 conditions per place. [2024-11-09 10:50:46,118 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-09 10:50:46,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 247 flow [2024-11-09 10:50:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:50:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:50:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-11-09 10:50:46,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2024-11-09 10:50:46,121 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 167 transitions. [2024-11-09 10:50:46,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 247 flow [2024-11-09 10:50:46,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:50:46,123 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2024-11-09 10:50:46,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-11-09 10:50:46,124 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-09 10:50:46,124 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2024-11-09 10:50:46,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 10:50:46,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:46,125 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:50:46,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:50:46,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:46,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:46,126 INFO L85 PathProgramCache]: Analyzing trace with hash 857701820, now seen corresponding path program 1 times [2024-11-09 10:50:46,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:46,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254315231] [2024-11-09 10:50:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:46,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:46,384 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-09 10:50:46,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:46,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254315231] [2024-11-09 10:50:46,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254315231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:46,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65297214] [2024-11-09 10:50:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:46,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:46,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:46,390 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-09 10:50:46,391 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-09 10:50:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:46,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:50:46,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:46,568 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-09 10:50:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:46,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:46,947 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-09 10:50:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65297214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:46,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-09 10:50:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798472262] [2024-11-09 10:50:46,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:50:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:46,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:50:46,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:50:47,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:47,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 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-09 10:50:47,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:47,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:47,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:48,609 INFO L124 PetriNetUnfolderBase]: 9653/13489 cut-off events. [2024-11-09 10:50:48,610 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 10:50:48,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25651 conditions, 13489 events. 9653/13489 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88101 event pairs, 6408 based on Foata normal form. 0/7910 useless extension candidates. Maximal degree in co-relation 25623. Up to 11904 conditions per place. [2024-11-09 10:50:48,735 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2024-11-09 10:50:48,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 269 flow [2024-11-09 10:50:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:50:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:50:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-11-09 10:50:48,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-11-09 10:50:48,737 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 6 states and 187 transitions. [2024-11-09 10:50:48,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 269 flow [2024-11-09 10:50:48,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:50:48,740 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 192 flow [2024-11-09 10:50:48,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-11-09 10:50:48,741 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-09 10:50:48,741 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 192 flow [2024-11-09 10:50:48,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 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-09 10:50:48,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:48,742 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-09 10:50:48,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:48,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:48,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash 820044476, now seen corresponding path program 1 times [2024-11-09 10:50:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471132497] [2024-11-09 10:50:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:49,161 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-09 10:50:49,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471132497] [2024-11-09 10:50:49,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471132497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415865136] [2024-11-09 10:50:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:49,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:49,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:49,165 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-09 10:50:49,166 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-09 10:50:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:49,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:50:49,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:49,275 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-09 10:50:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:49,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:49,531 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-09 10:50:49,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415865136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:49,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:49,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-09 10:50:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471159576] [2024-11-09 10:50:49,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:49,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:50:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:49,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:50:49,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:50:49,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:49,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 192 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 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-09 10:50:49,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:49,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:49,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:51,255 INFO L124 PetriNetUnfolderBase]: 9653/13488 cut-off events. [2024-11-09 10:50:51,256 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 10:50:51,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25655 conditions, 13488 events. 9653/13488 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88257 event pairs, 6408 based on Foata normal form. 0/7910 useless extension candidates. Maximal degree in co-relation 25622. Up to 11896 conditions per place. [2024-11-09 10:50:51,411 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 32 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2024-11-09 10:50:51,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 276 flow [2024-11-09 10:50:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:50:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:50:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2024-11-09 10:50:51,413 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2024-11-09 10:50:51,413 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 192 flow. Second operand 7 states and 213 transitions. [2024-11-09 10:50:51,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 276 flow [2024-11-09 10:50:51,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 242 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-11-09 10:50:51,419 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 178 flow [2024-11-09 10:50:51,420 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-11-09 10:50:51,423 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-09 10:50:51,423 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 178 flow [2024-11-09 10:50:51,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 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-09 10:50:51,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:51,424 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:51,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:51,625 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-09 10:50:51,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:51,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2134544703, now seen corresponding path program 1 times [2024-11-09 10:50:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846098967] [2024-11-09 10:50:51,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:51,745 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-09 10:50:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846098967] [2024-11-09 10:50:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846098967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:50:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058478155] [2024-11-09 10:50:51,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:50:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:50:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:50:51,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-09 10:50:51,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:51,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:51,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-09 10:50:51,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:53,193 INFO L124 PetriNetUnfolderBase]: 10696/14779 cut-off events. [2024-11-09 10:50:53,194 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 10:50:53,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28409 conditions, 14779 events. 10696/14779 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 96591 event pairs, 7188 based on Foata normal form. 298/9032 useless extension candidates. Maximal degree in co-relation 25256. Up to 11905 conditions per place. [2024-11-09 10:50:53,290 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 69 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2024-11-09 10:50:53,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 420 flow [2024-11-09 10:50:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:50:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:50:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-11-09 10:50:53,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-09 10:50:53,292 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 178 flow. Second operand 5 states and 207 transitions. [2024-11-09 10:50:53,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 420 flow [2024-11-09 10:50:53,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 381 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-11-09 10:50:53,295 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 192 flow [2024-11-09 10:50:53,295 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-11-09 10:50:53,296 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-09 10:50:53,296 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 192 flow [2024-11-09 10:50:53,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:53,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:53,297 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:53,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:50:53,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash -296438428, now seen corresponding path program 1 times [2024-11-09 10:50:53,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719506461] [2024-11-09 10:50:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:50:53,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:53,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719506461] [2024-11-09 10:50:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719506461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:50:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947241434] [2024-11-09 10:50:53,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:53,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:50:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:50:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:50:53,426 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:53,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:53,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:53,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:53,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:54,171 INFO L124 PetriNetUnfolderBase]: 7339/10713 cut-off events. [2024-11-09 10:50:54,171 INFO L125 PetriNetUnfolderBase]: For 1020/1020 co-relation queries the response was YES. [2024-11-09 10:50:54,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22212 conditions, 10713 events. 7339/10713 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 73007 event pairs, 5000 based on Foata normal form. 0/6785 useless extension candidates. Maximal degree in co-relation 19084. Up to 9261 conditions per place. [2024-11-09 10:50:54,264 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2024-11-09 10:50:54,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 272 flow [2024-11-09 10:50:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:50:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:50:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-11-09 10:50:54,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-11-09 10:50:54,266 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 192 flow. Second operand 5 states and 158 transitions. [2024-11-09 10:50:54,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 272 flow [2024-11-09 10:50:54,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:54,275 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 191 flow [2024-11-09 10:50:54,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-11-09 10:50:54,276 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-09 10:50:54,277 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 191 flow [2024-11-09 10:50:54,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:54,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:54,277 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:54,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:50:54,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:54,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash -296438427, now seen corresponding path program 1 times [2024-11-09 10:50:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263456976] [2024-11-09 10:50:54,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:54,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:54,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263456976] [2024-11-09 10:50:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263456976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264929195] [2024-11-09 10:50:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:54,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:54,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:54,490 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-09 10:50:54,492 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-09 10:50:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:54,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 10:50:54,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:54,588 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-09 10:50:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:50:54,649 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-09 10:50:54,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:50:54,667 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-09 10:50:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:54,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:50:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264929195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:50:54,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 10:50:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694108715] [2024-11-09 10:50:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:54,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:54,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:50:54,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:54,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:54,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:54,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:54,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:55,172 INFO L124 PetriNetUnfolderBase]: 4701/7063 cut-off events. [2024-11-09 10:50:55,172 INFO L125 PetriNetUnfolderBase]: For 804/804 co-relation queries the response was YES. [2024-11-09 10:50:55,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14076 conditions, 7063 events. 4701/7063 cut-off events. For 804/804 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 47471 event pairs, 3256 based on Foata normal form. 0/4989 useless extension candidates. Maximal degree in co-relation 10914. Up to 6049 conditions per place. [2024-11-09 10:50:55,224 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 39 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-09 10:50:55,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 267 flow [2024-11-09 10:50:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:50:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:50:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-09 10:50:55,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-09 10:50:55,225 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 191 flow. Second operand 4 states and 132 transitions. [2024-11-09 10:50:55,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 267 flow [2024-11-09 10:50:55,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:50:55,228 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 180 flow [2024-11-09 10:50:55,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-11-09 10:50:55,229 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2024-11-09 10:50:55,229 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 180 flow [2024-11-09 10:50:55,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:55,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:55,230 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:55,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:50:55,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:55,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1161509022, now seen corresponding path program 1 times [2024-11-09 10:50:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:55,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114603318] [2024-11-09 10:50:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:55,504 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-09 10:50:55,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:55,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114603318] [2024-11-09 10:50:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114603318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:55,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:50:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591102592] [2024-11-09 10:50:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:55,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:50:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:50:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:50:55,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:55,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:55,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:55,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:55,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:55,883 INFO L124 PetriNetUnfolderBase]: 3151/5000 cut-off events. [2024-11-09 10:50:55,884 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-11-09 10:50:55,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9801 conditions, 5000 events. 3151/5000 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 33845 event pairs, 2196 based on Foata normal form. 0/3932 useless extension candidates. Maximal degree in co-relation 7627. Up to 4084 conditions per place. [2024-11-09 10:50:55,914 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 36 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-11-09 10:50:55,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 256 flow [2024-11-09 10:50:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:50:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:50:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-09 10:50:55,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-09 10:50:55,916 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 180 flow. Second operand 4 states and 130 transitions. [2024-11-09 10:50:55,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 256 flow [2024-11-09 10:50:55,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:55,918 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 180 flow [2024-11-09 10:50:55,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-09 10:50:55,918 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-11-09 10:50:55,919 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 180 flow [2024-11-09 10:50:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:55,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:55,919 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:55,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:50:55,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:55,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1161509023, now seen corresponding path program 1 times [2024-11-09 10:50:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:55,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126293064] [2024-11-09 10:50:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:55,996 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-09 10:50:55,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:55,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126293064] [2024-11-09 10:50:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126293064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:55,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:55,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:50:55,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231354194] [2024-11-09 10:50:55,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:55,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:50:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:55,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:50:55,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:50:56,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-09 10:50:56,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-09 10:50:56,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:56,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-09 10:50:56,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:56,449 INFO L124 PetriNetUnfolderBase]: 3669/5895 cut-off events. [2024-11-09 10:50:56,450 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-09 10:50:56,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11668 conditions, 5895 events. 3669/5895 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 41164 event pairs, 2627 based on Foata normal form. 128/4903 useless extension candidates. Maximal degree in co-relation 9111. Up to 4094 conditions per place. [2024-11-09 10:50:56,482 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 54 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2024-11-09 10:50:56,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 352 flow [2024-11-09 10:50:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:50:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:50:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-11-09 10:50:56,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424 [2024-11-09 10:50:56,484 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 180 flow. Second operand 4 states and 163 transitions. [2024-11-09 10:50:56,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 352 flow [2024-11-09 10:50:56,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:56,486 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 197 flow [2024-11-09 10:50:56,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-09 10:50:56,487 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-09 10:50:56,487 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 197 flow [2024-11-09 10:50:56,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-09 10:50:56,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:56,488 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:56,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:50:56,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:56,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1396119792, now seen corresponding path program 1 times [2024-11-09 10:50:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551918536] [2024-11-09 10:50:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:56,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:56,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551918536] [2024-11-09 10:50:56,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551918536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:56,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:56,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:50:56,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091093001] [2024-11-09 10:50:56,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:56,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:56,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:56,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:56,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:50:56,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-09 10:50:56,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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-09 10:50:56,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:56,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-09 10:50:56,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:57,119 INFO L124 PetriNetUnfolderBase]: 2429/4116 cut-off events. [2024-11-09 10:50:57,119 INFO L125 PetriNetUnfolderBase]: For 957/957 co-relation queries the response was YES. [2024-11-09 10:50:57,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8569 conditions, 4116 events. 2429/4116 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 28790 event pairs, 1773 based on Foata normal form. 0/3544 useless extension candidates. Maximal degree in co-relation 6637. Up to 3292 conditions per place. [2024-11-09 10:50:57,144 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 33 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-11-09 10:50:57,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 265 flow [2024-11-09 10:50:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:50:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:50:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-09 10:50:57,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-11-09 10:50:57,146 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 197 flow. Second operand 4 states and 136 transitions. [2024-11-09 10:50:57,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 265 flow [2024-11-09 10:50:57,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:50:57,149 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 195 flow [2024-11-09 10:50:57,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-09 10:50:57,150 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-09 10:50:57,150 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 195 flow [2024-11-09 10:50:57,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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-09 10:50:57,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:57,150 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] [2024-11-09 10:50:57,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:50:57,151 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:57,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:57,151 INFO L85 PathProgramCache]: Analyzing trace with hash 270405486, now seen corresponding path program 1 times [2024-11-09 10:50:57,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:57,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035076794] [2024-11-09 10:50:57,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:57,304 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-09 10:50:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:57,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035076794] [2024-11-09 10:50:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035076794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:50:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483077397] [2024-11-09 10:50:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:57,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:57,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:57,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:50:57,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:57,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 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-09 10:50:57,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:57,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:57,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:57,889 INFO L124 PetriNetUnfolderBase]: 2952/4743 cut-off events. [2024-11-09 10:50:57,889 INFO L125 PetriNetUnfolderBase]: For 1127/1127 co-relation queries the response was YES. [2024-11-09 10:50:57,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10275 conditions, 4743 events. 2952/4743 cut-off events. For 1127/1127 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 31457 event pairs, 322 based on Foata normal form. 252/4847 useless extension candidates. Maximal degree in co-relation 8627. Up to 2532 conditions per place. [2024-11-09 10:50:57,918 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 61 selfloop transitions, 5 changer transitions 3/84 dead transitions. [2024-11-09 10:50:57,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 411 flow [2024-11-09 10:50:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:50:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:50:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-11-09 10:50:57,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2024-11-09 10:50:57,920 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 195 flow. Second operand 5 states and 182 transitions. [2024-11-09 10:50:57,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 411 flow [2024-11-09 10:50:57,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:57,924 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 179 flow [2024-11-09 10:50:57,924 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-09 10:50:57,925 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-09 10:50:57,925 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 179 flow [2024-11-09 10:50:57,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 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-09 10:50:57,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:57,925 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] [2024-11-09 10:50:57,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:50:57,925 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:57,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:57,926 INFO L85 PathProgramCache]: Analyzing trace with hash -608167966, now seen corresponding path program 1 times [2024-11-09 10:50:57,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:57,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080416777] [2024-11-09 10:50:57,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:57,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:58,131 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-09 10:50:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:58,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080416777] [2024-11-09 10:50:58,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080416777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:58,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:58,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:50:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530852642] [2024-11-09 10:50:58,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:58,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:58,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:58,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:50:58,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:58,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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-09 10:50:58,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:58,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:58,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:58,667 INFO L124 PetriNetUnfolderBase]: 3929/5758 cut-off events. [2024-11-09 10:50:58,667 INFO L125 PetriNetUnfolderBase]: For 3032/3578 co-relation queries the response was YES. [2024-11-09 10:50:58,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13988 conditions, 5758 events. 3929/5758 cut-off events. For 3032/3578 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 33817 event pairs, 480 based on Foata normal form. 743/6467 useless extension candidates. Maximal degree in co-relation 13960. Up to 3462 conditions per place. [2024-11-09 10:50:58,716 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 70 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-11-09 10:50:58,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 459 flow [2024-11-09 10:50:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:50:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:50:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-11-09 10:50:58,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.547979797979798 [2024-11-09 10:50:58,718 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 179 flow. Second operand 6 states and 217 transitions. [2024-11-09 10:50:58,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 459 flow [2024-11-09 10:50:58,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 444 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-09 10:50:58,722 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 227 flow [2024-11-09 10:50:58,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2024-11-09 10:50:58,723 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-11-09 10:50:58,724 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 227 flow [2024-11-09 10:50:58,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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-09 10:50:58,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:58,724 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] [2024-11-09 10:50:58,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:50:58,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:58,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2055308796, now seen corresponding path program 2 times [2024-11-09 10:50:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640130433] [2024-11-09 10:50:58,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:50:58,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640130433] [2024-11-09 10:50:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640130433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:58,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:50:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595188369] [2024-11-09 10:50:58,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:58,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:58,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:58,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:50:58,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:50:58,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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-09 10:50:58,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:58,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:50:58,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:59,852 INFO L124 PetriNetUnfolderBase]: 7315/11096 cut-off events. [2024-11-09 10:50:59,852 INFO L125 PetriNetUnfolderBase]: For 9679/10225 co-relation queries the response was YES. [2024-11-09 10:50:59,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29238 conditions, 11096 events. 7315/11096 cut-off events. For 9679/10225 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 76167 event pairs, 1649 based on Foata normal form. 699/11500 useless extension candidates. Maximal degree in co-relation 29208. Up to 4207 conditions per place. [2024-11-09 10:50:59,961 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 87 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2024-11-09 10:50:59,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 595 flow [2024-11-09 10:50:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:50:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:50:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2024-11-09 10:50:59,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-11-09 10:50:59,963 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 227 flow. Second operand 6 states and 230 transitions. [2024-11-09 10:50:59,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 595 flow [2024-11-09 10:50:59,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 582 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:59,986 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 301 flow [2024-11-09 10:50:59,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-11-09 10:50:59,987 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2024-11-09 10:50:59,987 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 301 flow [2024-11-09 10:50:59,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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-09 10:50:59,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:59,987 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] [2024-11-09 10:50:59,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:50:59,987 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:50:59,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash -966993856, now seen corresponding path program 3 times [2024-11-09 10:50:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898820362] [2024-11-09 10:50:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:51:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:51:00,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:51:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:51:00,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:51:00,088 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:51:00,090 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-09 10:51:00,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-09 10:51:00,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-09 10:51:00,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-09 10:51:00,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-09 10:51:00,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-09 10:51:00,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-09 10:51:00,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-09 10:51:00,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-09 10:51:00,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-09 10:51:00,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-09 10:51:00,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2024-11-09 10:51:00,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2024-11-09 10:51:00,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2024-11-09 10:51:00,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2024-11-09 10:51:00,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2024-11-09 10:51:00,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-09 10:51:00,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-09 10:51:00,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-09 10:51:00,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-09 10:51:00,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-09 10:51:00,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-09 10:51:00,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-09 10:51:00,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-09 10:51:00,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-09 10:51:00,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2024-11-09 10:51:00,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:51:00,096 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:00,214 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:51:00,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:51:00,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:51:00 BasicIcfg [2024-11-09 10:51:00,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:51:00,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:51:00,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:51:00,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:51:00,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:50:38" (3/4) ... [2024-11-09 10:51:00,223 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:51:00,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:51:00,225 INFO L158 Benchmark]: Toolchain (without parser) took 23088.35ms. Allocated memory was 144.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 88.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 126.1MB. Max. memory is 16.1GB. [2024-11-09 10:51:00,225 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 144.7MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:51:00,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.15ms. Allocated memory is still 144.7MB. Free memory was 88.1MB in the beginning and 73.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 10:51:00,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.79ms. Allocated memory is still 144.7MB. Free memory was 73.3MB in the beginning and 70.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:51:00,225 INFO L158 Benchmark]: Boogie Preprocessor took 68.43ms. Allocated memory is still 144.7MB. Free memory was 70.4MB in the beginning and 67.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:51:00,226 INFO L158 Benchmark]: RCFGBuilder took 1348.40ms. Allocated memory was 144.7MB in the beginning and 197.1MB in the end (delta: 52.4MB). Free memory was 67.1MB in the beginning and 75.1MB in the end (delta: -8.0MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-11-09 10:51:00,226 INFO L158 Benchmark]: TraceAbstraction took 21294.90ms. Allocated memory was 197.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 74.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-09 10:51:00,226 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 2.3GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:51:00,228 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 144.7MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.15ms. Allocated memory is still 144.7MB. Free memory was 88.1MB in the beginning and 73.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.79ms. Allocated memory is still 144.7MB. Free memory was 73.3MB in the beginning and 70.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.43ms. Allocated memory is still 144.7MB. Free memory was 70.4MB in the beginning and 67.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1348.40ms. Allocated memory was 144.7MB in the beginning and 197.1MB in the end (delta: 52.4MB). Free memory was 67.1MB in the beginning and 75.1MB in the end (delta: -8.0MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21294.90ms. Allocated memory was 197.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 74.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 2.3GB. Free memory is still 2.1GB. 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) [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={-4: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) [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={-4:0}, q2_back=0, q2_front=0, t1=-3, 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={-4: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={-4: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={-4: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={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, 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={-4:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) [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={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, 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={-4: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={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, 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={-4:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) [L120] 4 return 0; [L91] COND FALSE 3 !(\read(cond)) [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={-4: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={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [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={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, 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={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, 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={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, 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={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, 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={-4: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: 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: 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: 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: 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: -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, 99 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: 21.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1991 IncrementalHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 21 mSDtfsCounter, 1991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=14, InterpolantAutomatonStates: 68, 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.1s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 193 ConstructedInterpolants, 1 QuantifiedInterpolants, 1611 SizeOfPredicates, 8 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 9/20 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-09 10:51:00,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 10:51:02,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:51:02,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:51:02,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:51:02,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:51:03,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:51:03,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:51:03,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:51:03,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:51:03,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:51:03,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:51:03,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:51:03,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:51:03,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:51:03,009 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:51:03,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:51:03,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:51:03,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:51:03,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:51:03,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:51:03,014 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:51:03,017 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:51:03,017 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:51:03,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:51:03,018 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:51:03,018 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:51:03,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:51:03,018 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:51:03,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:51:03,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:51:03,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:51:03,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:51:03,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:51:03,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:51:03,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:51:03,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:51:03,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:51:03,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:51:03,033 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:51:03,033 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:51:03,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:51:03,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:51:03,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:51:03,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:51:03,034 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-09 10:51:03,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:51:03,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:51:03,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:51:03,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:51:03,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:51:03,436 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-09 10:51:04,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:51:05,236 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:51:05,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-09 10:51:05,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4336e3569/076506fcdfc24b9d99e9921ddf63aa3c/FLAGcbb84a7cf [2024-11-09 10:51:05,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4336e3569/076506fcdfc24b9d99e9921ddf63aa3c [2024-11-09 10:51:05,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:51:05,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:51:05,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:51:05,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:51:05,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:51:05,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:51:05" (1/1) ... [2024-11-09 10:51:05,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbcdb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:05, skipping insertion in model container [2024-11-09 10:51:05,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:51:05" (1/1) ... [2024-11-09 10:51:05,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:51:05,936 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:51:05,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:51:05,967 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:51:06,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:51:06,044 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:51:06,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06 WrapperNode [2024-11-09 10:51:06,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:51:06,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:51:06,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:51:06,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:51:06,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,118 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 300 [2024-11-09 10:51:06,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:51:06,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:51:06,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:51:06,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:51:06,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,168 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-09 10:51:06,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:51:06,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:51:06,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:51:06,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:51:06,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (1/1) ... [2024-11-09 10:51:06,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:51:06,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:51:06,254 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-09 10:51:06,257 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-09 10:51:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:51:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:51:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:51:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:51:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:51:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:51:06,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:51:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:51:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:51:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:51:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:51:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 10:51:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 10:51:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:51:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:51:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:51:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:51:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:51:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:51:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:51:06,310 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:51:06,460 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:51:06,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:51:07,170 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:51:07,170 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:51:07,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:51:07,609 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 10:51:07,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:51:07 BoogieIcfgContainer [2024-11-09 10:51:07,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:51:07,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:51:07,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:51:07,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:51:07,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:51:05" (1/3) ... [2024-11-09 10:51:07,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bed7b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:51:07, skipping insertion in model container [2024-11-09 10:51:07,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:06" (2/3) ... [2024-11-09 10:51:07,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bed7b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:51:07, skipping insertion in model container [2024-11-09 10:51:07,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:51:07" (3/3) ... [2024-11-09 10:51:07,620 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-09 10:51:07,635 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:51:07,635 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-09 10:51:07,635 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:51:07,732 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:51:07,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-09 10:51:07,809 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-09 10:51:07,809 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:51:07,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-09 10:51:07,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-09 10:51:07,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-09 10:51:07,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:51:07,834 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;@3243df65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:51:07,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-09 10:51:07,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:51:07,838 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:51:07,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:51:07,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:07,839 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:51:07,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:07,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash 866650, now seen corresponding path program 1 times [2024-11-09 10:51:07,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894556303] [2024-11-09 10:51:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:07,857 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-09 10:51:07,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:07,859 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-09 10:51:07,861 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-09 10:51:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:07,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:51:07,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:08,061 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-09 10:51:08,081 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-09 10:51:08,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:08,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894556303] [2024-11-09 10:51:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894556303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:08,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:08,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:51:08,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287702856] [2024-11-09 10:51:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:08,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:51:08,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:51:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:51:08,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:51:08,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:08,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:08,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:51:08,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:10,212 INFO L124 PetriNetUnfolderBase]: 9651/13134 cut-off events. [2024-11-09 10:51:10,213 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-11-09 10:51:10,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25668 conditions, 13134 events. 9651/13134 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82617 event pairs, 6408 based on Foata normal form. 1/7299 useless extension candidates. Maximal degree in co-relation 24078. Up to 11896 conditions per place. [2024-11-09 10:51:10,390 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-09 10:51:10,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-09 10:51:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:51:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:51:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-09 10:51:10,406 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-09 10:51:10,408 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-09 10:51:10,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-09 10:51:10,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:51:10,482 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-09 10:51:10,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-11-09 10:51:10,539 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-09 10:51:10,539 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-09 10:51:10,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:10,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:10,539 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:51:10,552 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-09 10:51:10,741 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-09 10:51:10,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:10,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 866651, now seen corresponding path program 1 times [2024-11-09 10:51:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:10,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726939588] [2024-11-09 10:51:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:10,745 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-09 10:51:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:10,749 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-09 10:51:10,750 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-09 10:51:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:10,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:51:10,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:10,895 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-09 10:51:11,000 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-09 10:51:11,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:11,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:11,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726939588] [2024-11-09 10:51:11,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726939588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:11,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:11,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:51:11,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003115326] [2024-11-09 10:51:11,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:11,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:51:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:11,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:51:11,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:51:11,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:51:11,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:11,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:11,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:51:11,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:12,878 INFO L124 PetriNetUnfolderBase]: 9653/13140 cut-off events. [2024-11-09 10:51:12,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:51:12,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25278 conditions, 13140 events. 9653/13140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82455 event pairs, 6408 based on Foata normal form. 0/7302 useless extension candidates. Maximal degree in co-relation 25242. Up to 11905 conditions per place. [2024-11-09 10:51:13,004 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-09 10:51:13,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 232 flow [2024-11-09 10:51:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:51:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:51:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-11-09 10:51:13,008 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-09 10:51:13,008 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 144 transitions. [2024-11-09 10:51:13,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 232 flow [2024-11-09 10:51:13,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:51:13,010 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 178 flow [2024-11-09 10:51:13,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2024-11-09 10:51:13,011 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-11-09 10:51:13,014 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 178 flow [2024-11-09 10:51:13,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:13,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:13,015 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:51:13,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:51:13,216 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-09 10:51:13,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:13,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash 832880270, now seen corresponding path program 1 times [2024-11-09 10:51:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578412006] [2024-11-09 10:51:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:13,218 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-09 10:51:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:13,224 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-09 10:51:13,225 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-09 10:51:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:13,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:51:13,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:13,303 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-09 10:51:13,492 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-09 10:51:13,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:13,791 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-09 10:51:13,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:13,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578412006] [2024-11-09 10:51:13,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578412006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:13,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:13,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-09 10:51:13,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206449487] [2024-11-09 10:51:13,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:13,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:51:13,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:13,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:51:13,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:51:13,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:51:13,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 178 flow. Second operand has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 0 states have call successors, (0), 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-09 10:51:13,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:13,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:51:13,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:16,419 INFO L124 PetriNetUnfolderBase]: 9659/13158 cut-off events. [2024-11-09 10:51:16,420 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:51:16,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25356 conditions, 13158 events. 9659/13158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82550 event pairs, 6408 based on Foata normal form. 0/7318 useless extension candidates. Maximal degree in co-relation 25253. Up to 11908 conditions per place. [2024-11-09 10:51:16,515 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2024-11-09 10:51:16,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 384 flow [2024-11-09 10:51:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:51:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:51:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 310 transitions. [2024-11-09 10:51:16,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-09 10:51:16,522 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 178 flow. Second operand 10 states and 310 transitions. [2024-11-09 10:51:16,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 384 flow [2024-11-09 10:51:16,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:51:16,527 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 340 flow [2024-11-09 10:51:16,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=340, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-11-09 10:51:16,530 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-09 10:51:16,530 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 340 flow [2024-11-09 10:51:16,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 0 states have call successors, (0), 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-09 10:51:16,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:16,531 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:16,535 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-09 10:51:16,732 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-09 10:51:16,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:16,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1724412099, now seen corresponding path program 1 times [2024-11-09 10:51:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236700782] [2024-11-09 10:51:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:16,734 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-09 10:51:16,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:16,738 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-09 10:51:16,739 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-09 10:51:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:16,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:51:16,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:16,861 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-09 10:51:16,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:16,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236700782] [2024-11-09 10:51:16,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236700782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:16,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:16,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:51:16,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051897380] [2024-11-09 10:51:16,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:16,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:51:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:16,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:51:16,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:51:16,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-09 10:51:16,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:16,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:16,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-09 10:51:16,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:18,286 INFO L124 PetriNetUnfolderBase]: 10705/14769 cut-off events. [2024-11-09 10:51:18,286 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-09 10:51:18,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28518 conditions, 14769 events. 10705/14769 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 95736 event pairs, 7188 based on Foata normal form. 299/8998 useless extension candidates. Maximal degree in co-relation 28430. Up to 11923 conditions per place. [2024-11-09 10:51:18,435 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 98 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2024-11-09 10:51:18,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 120 transitions, 700 flow [2024-11-09 10:51:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:51:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:51:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2024-11-09 10:51:18,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2024-11-09 10:51:18,438 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 340 flow. Second operand 4 states and 178 transitions. [2024-11-09 10:51:18,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 120 transitions, 700 flow [2024-11-09 10:51:18,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 120 transitions, 606 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-11-09 10:51:18,443 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 295 flow [2024-11-09 10:51:18,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-11-09 10:51:18,444 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-09 10:51:18,444 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 295 flow [2024-11-09 10:51:18,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:18,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:18,444 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:18,449 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-09 10:51:18,645 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-09 10:51:18,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:18,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1238289958, now seen corresponding path program 1 times [2024-11-09 10:51:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:18,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795922800] [2024-11-09 10:51:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:18,647 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-09 10:51:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:18,650 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-09 10:51:18,651 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-09 10:51:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:18,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:51:18,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:18,728 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-09 10:51:18,769 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-09 10:51:18,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:18,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795922800] [2024-11-09 10:51:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795922800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:18,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:51:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524936893] [2024-11-09 10:51:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:18,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:51:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:51:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:51:18,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:51:18,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:18,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:18,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:51:18,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:19,750 INFO L124 PetriNetUnfolderBase]: 7182/10538 cut-off events. [2024-11-09 10:51:19,750 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2024-11-09 10:51:19,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22435 conditions, 10538 events. 7182/10538 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 71537 event pairs, 4852 based on Foata normal form. 0/6695 useless extension candidates. Maximal degree in co-relation 22359. Up to 9010 conditions per place. [2024-11-09 10:51:19,847 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 54 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2024-11-09 10:51:19,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 411 flow [2024-11-09 10:51:19,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:51:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:51:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-09 10:51:19,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-11-09 10:51:19,849 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 295 flow. Second operand 4 states and 134 transitions. [2024-11-09 10:51:19,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 411 flow [2024-11-09 10:51:19,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 407 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:51:19,858 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 299 flow [2024-11-09 10:51:19,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2024-11-09 10:51:19,859 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-09 10:51:19,859 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 299 flow [2024-11-09 10:51:19,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:19,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:19,860 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:19,864 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-09 10:51:20,061 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-09 10:51:20,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:20,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1238289957, now seen corresponding path program 1 times [2024-11-09 10:51:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:20,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101136539] [2024-11-09 10:51:20,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:20,063 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-09 10:51:20,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:20,064 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-09 10:51:20,065 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-09 10:51:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:20,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:51:20,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:20,209 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-09 10:51:20,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:20,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:20,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101136539] [2024-11-09 10:51:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101136539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:20,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:51:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022415457] [2024-11-09 10:51:20,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:20,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:51:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:20,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:51:20,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:51:20,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-09 10:51:20,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-09 10:51:20,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:20,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-09 10:51:20,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:21,453 INFO L124 PetriNetUnfolderBase]: 8415/12414 cut-off events. [2024-11-09 10:51:21,454 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2024-11-09 10:51:21,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26771 conditions, 12414 events. 8415/12414 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 87551 event pairs, 5813 based on Foata normal form. 278/8300 useless extension candidates. Maximal degree in co-relation 26693. Up to 9041 conditions per place. [2024-11-09 10:51:21,572 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 77 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2024-11-09 10:51:21,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 535 flow [2024-11-09 10:51:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:51:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:51:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2024-11-09 10:51:21,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2024-11-09 10:51:21,574 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 299 flow. Second operand 4 states and 171 transitions. [2024-11-09 10:51:21,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 535 flow [2024-11-09 10:51:21,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 520 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:51:21,580 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 307 flow [2024-11-09 10:51:21,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-11-09 10:51:21,581 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2024-11-09 10:51:21,581 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 307 flow [2024-11-09 10:51:21,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-09 10:51:21,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:21,581 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:21,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:51:21,782 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-09 10:51:21,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:21,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash -417123471, now seen corresponding path program 1 times [2024-11-09 10:51:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:21,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989779313] [2024-11-09 10:51:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:21,784 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-09 10:51:21,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:21,786 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-09 10:51:21,787 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-09 10:51:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:21,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 10:51:21,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:21,902 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-09 10:51:21,922 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-09 10:51:22,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:51:22,125 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-09 10:51:22,145 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:51:22,145 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-09 10:51:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:22,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:23,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989779313] [2024-11-09 10:51:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989779313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:23,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-09 10:51:23,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243471261] [2024-11-09 10:51:23,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:23,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:51:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:51:23,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:51:23,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-11-09 10:51:23,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 307 flow. Second operand has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 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-09 10:51:23,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:23,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-11-09 10:51:23,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:30,840 INFO L124 PetriNetUnfolderBase]: 18393/27640 cut-off events. [2024-11-09 10:51:30,840 INFO L125 PetriNetUnfolderBase]: For 5198/5198 co-relation queries the response was YES. [2024-11-09 10:51:30,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63602 conditions, 27640 events. 18393/27640 cut-off events. For 5198/5198 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 215219 event pairs, 12645 based on Foata normal form. 0/19455 useless extension candidates. Maximal degree in co-relation 43495. Up to 9616 conditions per place. [2024-11-09 10:51:31,107 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 107 selfloop transitions, 46 changer transitions 0/170 dead transitions. [2024-11-09 10:51:31,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 170 transitions, 979 flow [2024-11-09 10:51:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:51:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:51:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 433 transitions. [2024-11-09 10:51:31,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4686147186147186 [2024-11-09 10:51:31,111 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 307 flow. Second operand 14 states and 433 transitions. [2024-11-09 10:51:31,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 170 transitions, 979 flow [2024-11-09 10:51:31,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 170 transitions, 970 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:51:31,122 INFO L231 Difference]: Finished difference. Result has 94 places, 105 transitions, 618 flow [2024-11-09 10:51:31,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=618, PETRI_PLACES=94, PETRI_TRANSITIONS=105} [2024-11-09 10:51:31,123 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-11-09 10:51:31,123 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 618 flow [2024-11-09 10:51:31,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 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-09 10:51:31,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:31,124 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:31,128 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-09 10:51:31,324 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-09 10:51:31,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:31,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -417123472, now seen corresponding path program 1 times [2024-11-09 10:51:31,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:31,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27872061] [2024-11-09 10:51:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:31,326 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-09 10:51:31,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:31,329 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-09 10:51:31,330 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-09 10:51:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:31,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:51:31,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:31,422 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-09 10:51:31,449 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:51:31,449 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-09 10:51:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:31,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:31,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27872061] [2024-11-09 10:51:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27872061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:51:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989017477] [2024-11-09 10:51:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:31,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:51:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:51:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:51:31,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:51:31,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 105 transitions, 618 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:31,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:31,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:51:31,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:32,918 INFO L124 PetriNetUnfolderBase]: 11532/18365 cut-off events. [2024-11-09 10:51:32,918 INFO L125 PetriNetUnfolderBase]: For 9067/9067 co-relation queries the response was YES. [2024-11-09 10:51:33,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42288 conditions, 18365 events. 11532/18365 cut-off events. For 9067/9067 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 145004 event pairs, 8046 based on Foata normal form. 0/14951 useless extension candidates. Maximal degree in co-relation 34726. Up to 14950 conditions per place. [2024-11-09 10:51:33,079 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 69 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2024-11-09 10:51:33,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 778 flow [2024-11-09 10:51:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:51:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:51:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-09 10:51:33,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-11-09 10:51:33,080 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 618 flow. Second operand 5 states and 156 transitions. [2024-11-09 10:51:33,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 103 transitions, 778 flow [2024-11-09 10:51:33,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:51:33,099 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 637 flow [2024-11-09 10:51:33,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=637, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2024-11-09 10:51:33,102 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 27 predicate places. [2024-11-09 10:51:33,102 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 637 flow [2024-11-09 10:51:33,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:33,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:33,103 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-11-09 10:51:33,107 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-09 10:51:33,306 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-09 10:51:33,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:33,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash -913765977, now seen corresponding path program 2 times [2024-11-09 10:51:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:33,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332000737] [2024-11-09 10:51:33,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:51:33,308 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-09 10:51:33,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:33,309 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-09 10:51:33,310 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-09 10:51:33,368 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:51:33,369 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:51:33,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:51:33,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:33,385 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-09 10:51:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:33,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:34,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:34,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332000737] [2024-11-09 10:51:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332000737] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:34,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:34,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-09 10:51:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070593970] [2024-11-09 10:51:34,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:34,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:51:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:34,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:51:34,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:51:34,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:51:34,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 637 flow. Second operand has 14 states, 14 states have (on average 25.571428571428573) internal successors, (358), 14 states have internal predecessors, (358), 0 states have call successors, (0), 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-09 10:51:34,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:34,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:51:34,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:37,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 10:51:39,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 10:51:45,030 INFO L124 PetriNetUnfolderBase]: 11562/18455 cut-off events. [2024-11-09 10:51:45,030 INFO L125 PetriNetUnfolderBase]: For 9255/9255 co-relation queries the response was YES. [2024-11-09 10:51:45,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42787 conditions, 18455 events. 11562/18455 cut-off events. For 9255/9255 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 145996 event pairs, 8046 based on Foata normal form. 30/15071 useless extension candidates. Maximal degree in co-relation 35119. Up to 14995 conditions per place. [2024-11-09 10:51:45,210 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 107 changer transitions 0/163 dead transitions. [2024-11-09 10:51:45,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 163 transitions, 1421 flow [2024-11-09 10:51:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 10:51:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-09 10:51:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 636 transitions. [2024-11-09 10:51:45,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2024-11-09 10:51:45,213 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 637 flow. Second operand 22 states and 636 transitions. [2024-11-09 10:51:45,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 163 transitions, 1421 flow [2024-11-09 10:51:45,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 163 transitions, 1382 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:51:45,232 INFO L231 Difference]: Finished difference. Result has 119 places, 163 transitions, 1394 flow [2024-11-09 10:51:45,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1394, PETRI_PLACES=119, PETRI_TRANSITIONS=163} [2024-11-09 10:51:45,233 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2024-11-09 10:51:45,233 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 163 transitions, 1394 flow [2024-11-09 10:51:45,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 25.571428571428573) internal successors, (358), 14 states have internal predecessors, (358), 0 states have call successors, (0), 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-09 10:51:45,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:45,233 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:45,237 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:51:45,434 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-09 10:51:45,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 10:51:45,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1036105231, now seen corresponding path program 1 times [2024-11-09 10:51:45,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:45,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488751543] [2024-11-09 10:51:45,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:45,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:45,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:45,438 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-09 10:51:45,440 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-09 10:51:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:45,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 10:51:45,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:45,533 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-09 10:51:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:45,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:46,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:46,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488751543] [2024-11-09 10:51:46,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488751543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:46,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:46,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 10:51:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941855111] [2024-11-09 10:51:46,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:51:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:51:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:51:46,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-09 10:51:46,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 163 transitions, 1394 flow. Second operand has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 0 states have call successors, (0), 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-09 10:51:46,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:46,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-09 10:51:46,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand