./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-atomic/lamport.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:06:26,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:06:26,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:06:26,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:06:26,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:06:26,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:06:26,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:06:26,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:06:26,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:06:26,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:06:26,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:06:26,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:06:26,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:06:26,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:06:26,986 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:06:26,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:06:26,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:06:26,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:06:26,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:06:26,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:06:26,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:06:26,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:06:26,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:06:26,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:06:26,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:06:26,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:06:26,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:06:26,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:06:26,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:06:26,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:06:26,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:06:26,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:06:26,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:06:26,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:06:26,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:06:26,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:06:26,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:06:26,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:06:26,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:06:26,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:06:26,994 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:06:26,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:06:26,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:06:26,995 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 ! call(reach_error())) ) 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 -> c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 [2024-01-27 15:06:27,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:06:27,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:06:27,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:06:27,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:06:27,284 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:06:27,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2024-01-27 15:06:28,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:06:28,666 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:06:28,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2024-01-27 15:06:28,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080b22af3/e7c902154ae44f84aee4134431c6d388/FLAG817b2dcdd [2024-01-27 15:06:28,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080b22af3/e7c902154ae44f84aee4134431c6d388 [2024-01-27 15:06:28,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:06:28,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:06:28,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:06:28,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:06:28,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:06:28,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:06:28" (1/1) ... [2024-01-27 15:06:28,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c007022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:28, skipping insertion in model container [2024-01-27 15:06:28,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:06:28" (1/1) ... [2024-01-27 15:06:28,763 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:06:29,090 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2024-01-27 15:06:29,101 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[34083,34096] [2024-01-27 15:06:29,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:06:29,124 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:06:29,169 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2024-01-27 15:06:29,178 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[34083,34096] [2024-01-27 15:06:29,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:06:29,228 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:06:29,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29 WrapperNode [2024-01-27 15:06:29,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:06:29,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:06:29,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:06:29,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:06:29,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,290 INFO L138 Inliner]: procedures = 170, calls = 82, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2024-01-27 15:06:29,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:06:29,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:06:29,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:06:29,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:06:29,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,340 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-27 15:06:29,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:06:29,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:06:29,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:06:29,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:06:29,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (1/1) ... [2024-01-27 15:06:29,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:06:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:06:29,415 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-01-27 15:06:29,442 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-01-27 15:06:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:06:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:06:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:06:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-01-27 15:06:29,472 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-01-27 15:06:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-01-27 15:06:29,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-01-27 15:06:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:06:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:06:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:06:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:06:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:06:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:06:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:06:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:06:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:06:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:06:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:06:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:06:29,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:06:29,478 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:06:29,604 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:06:29,606 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:06:29,756 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:06:29,757 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:06:29,860 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:06:29,861 INFO L320 CfgBuilder]: Removed 8 assume(true) statements. [2024-01-27 15:06:29,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:06:29 BoogieIcfgContainer [2024-01-27 15:06:29,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:06:29,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:06:29,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:06:29,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:06:29,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:06:28" (1/3) ... [2024-01-27 15:06:29,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef76629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:06:29, skipping insertion in model container [2024-01-27 15:06:29,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:29" (2/3) ... [2024-01-27 15:06:29,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef76629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:06:29, skipping insertion in model container [2024-01-27 15:06:29,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:06:29" (3/3) ... [2024-01-27 15:06:29,869 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-01-27 15:06:29,877 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:06:29,886 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:06:29,887 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 15:06:29,887 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:06:29,956 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:06:29,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 89 transitions, 192 flow [2024-01-27 15:06:30,026 INFO L124 PetriNetUnfolderBase]: 18/87 cut-off events. [2024-01-27 15:06:30,026 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:06:30,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 18/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 228 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-01-27 15:06:30,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 89 transitions, 192 flow [2024-01-27 15:06:30,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 85 transitions, 179 flow [2024-01-27 15:06:30,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:06:30,049 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5d72aaa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:06:30,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 15:06:30,056 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:06:30,056 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-01-27 15:06:30,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 15:06:30,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:30,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:06:30,057 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:30,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1224895087, now seen corresponding path program 1 times [2024-01-27 15:06:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570328036] [2024-01-27 15:06:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:30,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:30,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570328036] [2024-01-27 15:06:30,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570328036] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:30,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:30,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:06:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469098907] [2024-01-27 15:06:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:30,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-27 15:06:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-27 15:06:30,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-27 15:06:30,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2024-01-27 15:06:30,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 179 flow. Second operand has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 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-01-27 15:06:30,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:30,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2024-01-27 15:06:30,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:30,507 INFO L124 PetriNetUnfolderBase]: 172/547 cut-off events. [2024-01-27 15:06:30,507 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-27 15:06:30,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 547 events. 172/547 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3118 event pairs, 54 based on Foata normal form. 85/527 useless extension candidates. Maximal degree in co-relation 701. Up to 201 conditions per place. [2024-01-27 15:06:30,518 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 17 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2024-01-27 15:06:30,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 201 flow [2024-01-27 15:06:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-27 15:06:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-27 15:06:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2024-01-27 15:06:30,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.848314606741573 [2024-01-27 15:06:30,534 INFO L175 Difference]: Start difference. First operand has 74 places, 85 transitions, 179 flow. Second operand 2 states and 151 transitions. [2024-01-27 15:06:30,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 201 flow [2024-01-27 15:06:30,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 15:06:30,544 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 162 flow [2024-01-27 15:06:30,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=162, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2024-01-27 15:06:30,552 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2024-01-27 15:06:30,552 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 162 flow [2024-01-27 15:06:30,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 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-01-27 15:06:30,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:30,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:06:30,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:06:30,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:30,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:30,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1982847106, now seen corresponding path program 1 times [2024-01-27 15:06:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:30,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099046761] [2024-01-27 15:06:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:30,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:30,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099046761] [2024-01-27 15:06:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099046761] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:30,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:30,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:06:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027671081] [2024-01-27 15:06:30,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:30,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:06:30,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:06:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:06:30,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 89 [2024-01-27 15:06:30,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-01-27 15:06:30,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:30,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 89 [2024-01-27 15:06:30,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:30,873 INFO L124 PetriNetUnfolderBase]: 261/695 cut-off events. [2024-01-27 15:06:30,873 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-27 15:06:30,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 695 events. 261/695 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4181 event pairs, 57 based on Foata normal form. 20/617 useless extension candidates. Maximal degree in co-relation 1053. Up to 215 conditions per place. [2024-01-27 15:06:30,880 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 27 selfloop transitions, 3 changer transitions 1/89 dead transitions. [2024-01-27 15:06:30,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 245 flow [2024-01-27 15:06:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:06:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:06:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-01-27 15:06:30,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.797752808988764 [2024-01-27 15:06:30,888 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 162 flow. Second operand 3 states and 213 transitions. [2024-01-27 15:06:30,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 245 flow [2024-01-27 15:06:30,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:06:30,892 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 182 flow [2024-01-27 15:06:30,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2024-01-27 15:06:30,893 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2024-01-27 15:06:30,894 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 182 flow [2024-01-27 15:06:30,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-01-27 15:06:30,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:30,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:06:30,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:06:30,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:30,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash -246904762, now seen corresponding path program 1 times [2024-01-27 15:06:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:30,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426982790] [2024-01-27 15:06:30,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:30,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:31,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426982790] [2024-01-27 15:06:31,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426982790] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:31,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:31,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:06:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549481050] [2024-01-27 15:06:31,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:31,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:06:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:31,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:06:31,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:06:31,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 89 [2024-01-27 15:06:31,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-01-27 15:06:31,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:31,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 89 [2024-01-27 15:06:31,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:31,133 INFO L124 PetriNetUnfolderBase]: 270/708 cut-off events. [2024-01-27 15:06:31,134 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-01-27 15:06:31,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 708 events. 270/708 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4318 event pairs, 81 based on Foata normal form. 20/624 useless extension candidates. Maximal degree in co-relation 1209. Up to 276 conditions per place. [2024-01-27 15:06:31,140 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 25 selfloop transitions, 2 changer transitions 4/89 dead transitions. [2024-01-27 15:06:31,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 263 flow [2024-01-27 15:06:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:06:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:06:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-01-27 15:06:31,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.797752808988764 [2024-01-27 15:06:31,142 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 182 flow. Second operand 3 states and 213 transitions. [2024-01-27 15:06:31,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 263 flow [2024-01-27 15:06:31,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 89 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:06:31,145 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 186 flow [2024-01-27 15:06:31,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-01-27 15:06:31,146 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2024-01-27 15:06:31,147 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 186 flow [2024-01-27 15:06:31,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-01-27 15:06:31,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:31,147 INFO L208 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] [2024-01-27 15:06:31,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:06:31,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:31,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1019058988, now seen corresponding path program 1 times [2024-01-27 15:06:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:31,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626695232] [2024-01-27 15:06:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:31,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:31,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:31,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626695232] [2024-01-27 15:06:31,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626695232] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:31,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:31,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:06:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336699500] [2024-01-27 15:06:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:31,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:06:31,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:06:31,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:06:31,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 89 [2024-01-27 15:06:31,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-01-27 15:06:31,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:31,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 89 [2024-01-27 15:06:31,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:31,588 INFO L124 PetriNetUnfolderBase]: 846/2100 cut-off events. [2024-01-27 15:06:31,589 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2024-01-27 15:06:31,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 2100 events. 846/2100 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15234 event pairs, 203 based on Foata normal form. 56/2026 useless extension candidates. Maximal degree in co-relation 3533. Up to 645 conditions per place. [2024-01-27 15:06:31,602 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 49 selfloop transitions, 10 changer transitions 11/122 dead transitions. [2024-01-27 15:06:31,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 122 transitions, 413 flow [2024-01-27 15:06:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:06:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:06:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2024-01-27 15:06:31,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7707865168539326 [2024-01-27 15:06:31,604 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 186 flow. Second operand 5 states and 343 transitions. [2024-01-27 15:06:31,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 122 transitions, 413 flow [2024-01-27 15:06:31,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 122 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:06:31,610 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 290 flow [2024-01-27 15:06:31,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2024-01-27 15:06:31,611 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2024-01-27 15:06:31,612 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 290 flow [2024-01-27 15:06:31,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-01-27 15:06:31,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:31,612 INFO L208 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] [2024-01-27 15:06:31,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:06:31,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:31,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:31,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1185317750, now seen corresponding path program 2 times [2024-01-27 15:06:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:31,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837338406] [2024-01-27 15:06:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:31,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:31,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:31,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837338406] [2024-01-27 15:06:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837338406] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:31,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:31,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:06:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019845986] [2024-01-27 15:06:31,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:31,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:06:31,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:31,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:06:31,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:06:31,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 89 [2024-01-27 15:06:31,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-01-27 15:06:31,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:31,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 89 [2024-01-27 15:06:31,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:32,053 INFO L124 PetriNetUnfolderBase]: 1079/2808 cut-off events. [2024-01-27 15:06:32,053 INFO L125 PetriNetUnfolderBase]: For 1319/1489 co-relation queries the response was YES. [2024-01-27 15:06:32,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5909 conditions, 2808 events. 1079/2808 cut-off events. For 1319/1489 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 21366 event pairs, 302 based on Foata normal form. 128/2818 useless extension candidates. Maximal degree in co-relation 5900. Up to 991 conditions per place. [2024-01-27 15:06:32,076 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 48 selfloop transitions, 11 changer transitions 13/130 dead transitions. [2024-01-27 15:06:32,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 130 transitions, 555 flow [2024-01-27 15:06:32,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:06:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:06:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2024-01-27 15:06:32,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7662921348314606 [2024-01-27 15:06:32,079 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 290 flow. Second operand 5 states and 341 transitions. [2024-01-27 15:06:32,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 130 transitions, 555 flow [2024-01-27 15:06:32,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 527 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-01-27 15:06:32,095 INFO L231 Difference]: Finished difference. Result has 90 places, 98 transitions, 380 flow [2024-01-27 15:06:32,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=90, PETRI_TRANSITIONS=98} [2024-01-27 15:06:32,097 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2024-01-27 15:06:32,097 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 98 transitions, 380 flow [2024-01-27 15:06:32,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-01-27 15:06:32,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:32,098 INFO L208 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] [2024-01-27 15:06:32,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:06:32,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:32,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:32,100 INFO L85 PathProgramCache]: Analyzing trace with hash 738454086, now seen corresponding path program 3 times [2024-01-27 15:06:32,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:32,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440034981] [2024-01-27 15:06:32,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:32,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:32,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440034981] [2024-01-27 15:06:32,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440034981] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:32,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:32,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:06:32,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621841295] [2024-01-27 15:06:32,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:32,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:06:32,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:06:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:06:32,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 89 [2024-01-27 15:06:32,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 98 transitions, 380 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-01-27 15:06:32,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:32,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 89 [2024-01-27 15:06:32,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:32,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res.base_1| 0) (= |v_thr2Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_1|, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_#res.offset][83], [Black: 97#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 94#(= ~y~0 1), 73#L710true, 102#true, 50#thr2EXITtrue, Black: 104#(= 2 ~y~0), thr2Thread1of1ForFork0InUse, Black: 107#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 81#true, Black: 105#(= 2 thr1Thread1of1ForFork1_~y1~0), 112#true, 90#(= ~X~0 1), 39#L847-1true, Black: 85#(= ~X~0 0), 92#true]) [2024-01-27 15:06:32,487 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-27 15:06:32,487 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:32,487 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:06:32,487 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-27 15:06:32,800 INFO L124 PetriNetUnfolderBase]: 1811/5522 cut-off events. [2024-01-27 15:06:32,800 INFO L125 PetriNetUnfolderBase]: For 2717/3076 co-relation queries the response was YES. [2024-01-27 15:06:32,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11487 conditions, 5522 events. 1811/5522 cut-off events. For 2717/3076 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 51191 event pairs, 343 based on Foata normal form. 176/5337 useless extension candidates. Maximal degree in co-relation 11475. Up to 786 conditions per place. [2024-01-27 15:06:32,844 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 58 selfloop transitions, 6 changer transitions 0/141 dead transitions. [2024-01-27 15:06:32,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 141 transitions, 642 flow [2024-01-27 15:06:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:06:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:06:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 365 transitions. [2024-01-27 15:06:32,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8202247191011236 [2024-01-27 15:06:32,846 INFO L175 Difference]: Start difference. First operand has 90 places, 98 transitions, 380 flow. Second operand 5 states and 365 transitions. [2024-01-27 15:06:32,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 141 transitions, 642 flow [2024-01-27 15:06:32,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 612 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-01-27 15:06:32,859 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 414 flow [2024-01-27 15:06:32,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=414, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2024-01-27 15:06:32,861 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2024-01-27 15:06:32,862 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 414 flow [2024-01-27 15:06:32,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-01-27 15:06:32,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:32,862 INFO L208 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] [2024-01-27 15:06:32,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:06:32,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:32,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1647000906, now seen corresponding path program 4 times [2024-01-27 15:06:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:32,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597317485] [2024-01-27 15:06:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:32,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:32,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597317485] [2024-01-27 15:06:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597317485] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:32,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:06:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424019782] [2024-01-27 15:06:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:32,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:06:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:06:32,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:06:32,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 89 [2024-01-27 15:06:32,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-01-27 15:06:32,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:32,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 89 [2024-01-27 15:06:32,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:33,912 INFO L124 PetriNetUnfolderBase]: 2682/8281 cut-off events. [2024-01-27 15:06:33,913 INFO L125 PetriNetUnfolderBase]: For 4377/4810 co-relation queries the response was YES. [2024-01-27 15:06:33,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17401 conditions, 8281 events. 2682/8281 cut-off events. For 4377/4810 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 80614 event pairs, 477 based on Foata normal form. 293/8236 useless extension candidates. Maximal degree in co-relation 17386. Up to 1220 conditions per place. [2024-01-27 15:06:33,973 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 63 selfloop transitions, 11 changer transitions 0/153 dead transitions. [2024-01-27 15:06:33,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 153 transitions, 729 flow [2024-01-27 15:06:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:06:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:06:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2024-01-27 15:06:33,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8292134831460675 [2024-01-27 15:06:33,975 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 414 flow. Second operand 5 states and 369 transitions. [2024-01-27 15:06:33,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 153 transitions, 729 flow [2024-01-27 15:06:33,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 153 transitions, 729 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:06:33,987 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 508 flow [2024-01-27 15:06:33,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=508, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2024-01-27 15:06:33,989 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 30 predicate places. [2024-01-27 15:06:33,989 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 508 flow [2024-01-27 15:06:33,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-01-27 15:06:33,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:33,990 INFO L208 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] [2024-01-27 15:06:33,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:06:33,990 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:33,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:33,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1271307899, now seen corresponding path program 1 times [2024-01-27 15:06:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196334485] [2024-01-27 15:06:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196334485] [2024-01-27 15:06:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196334485] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:34,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:06:34,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909033861] [2024-01-27 15:06:34,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:34,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:06:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:34,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:06:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:06:34,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 89 [2024-01-27 15:06:34,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 508 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-01-27 15:06:34,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:34,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 89 [2024-01-27 15:06:34,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:34,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][18], [Black: 124#(= ~x~0 1), 60#L780true, Black: 127#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 97#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 125#(= thr2Thread1of1ForFork0_~x2~0 1), 114#(= 2 ~x~0), Black: 92#true, 122#true, 102#true, 134#(= ~b2~0 1), Black: 104#(= 2 ~y~0), Black: 107#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), thr2Thread1of1ForFork0InUse, 81#true, 94#(= ~y~0 1), 15#L733true, Black: 83#true, Black: 115#(= 2 thr1Thread1of1ForFork1_~x1~0), Black: 112#true, Black: 117#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), 7#L846-4true, Black: 90#(= ~X~0 1)]) [2024-01-27 15:06:34,510 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:06:34,510 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-27 15:06:34,510 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:34,510 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 15:06:34,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][18], [Black: 124#(= ~x~0 1), 60#L780true, Black: 127#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 97#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 125#(= thr2Thread1of1ForFork0_~x2~0 1), 114#(= 2 ~x~0), Black: 92#true, 122#true, 102#true, 134#(= ~b2~0 1), Black: 104#(= 2 ~y~0), thr2Thread1of1ForFork0InUse, Black: 107#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 81#true, 94#(= ~y~0 1), 15#L733true, Black: 83#true, Black: 115#(= 2 thr1Thread1of1ForFork1_~x1~0), 39#L847-1true, Black: 112#true, Black: 117#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), Black: 90#(= ~X~0 1)]) [2024-01-27 15:06:34,531 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-27 15:06:34,531 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:06:34,531 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-27 15:06:34,531 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:34,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L737-->L744: Formula: (= v_~b2~0_5 v_thr1Thread1of1ForFork1_~b21~0_1) InVars {~b2~0=v_~b2~0_5} OutVars{~b2~0=v_~b2~0_5, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0][41], [Black: 122#true, Black: 127#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 97#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 125#(= thr2Thread1of1ForFork0_~x2~0 1), Black: 92#true, 137#(and (= thr1Thread1of1ForFork1_~b21~0 1) (= ~b2~0 1)), 102#true, Black: 104#(= 2 ~y~0), Black: 107#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), thr2Thread1of1ForFork0InUse, 81#true, 94#(= ~y~0 1), 112#true, 124#(= ~x~0 1), Black: 83#true, Black: 115#(= 2 thr1Thread1of1ForFork1_~x1~0), 28#L777true, Black: 114#(= 2 ~x~0), Black: 117#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), 7#L846-4true, Black: 90#(= ~X~0 1), 68#L744true]) [2024-01-27 15:06:34,559 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-01-27 15:06:34,559 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-27 15:06:34,559 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:06:34,559 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:34,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L737-->L744: Formula: (= v_~b2~0_5 v_thr1Thread1of1ForFork1_~b21~0_1) InVars {~b2~0=v_~b2~0_5} OutVars{~b2~0=v_~b2~0_5, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0][41], [Black: 122#true, Black: 127#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 97#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), Black: 125#(= thr2Thread1of1ForFork0_~x2~0 1), Black: 92#true, 137#(and (= thr1Thread1of1ForFork1_~b21~0 1) (= ~b2~0 1)), 102#true, Black: 104#(= 2 ~y~0), thr2Thread1of1ForFork0InUse, Black: 107#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 81#true, 94#(= ~y~0 1), 112#true, 124#(= ~x~0 1), Black: 83#true, Black: 115#(= 2 thr1Thread1of1ForFork1_~x1~0), 39#L847-1true, Black: 114#(= 2 ~x~0), 28#L777true, Black: 117#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0)), Black: 90#(= ~X~0 1), 68#L744true]) [2024-01-27 15:06:34,582 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-27 15:06:34,582 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-27 15:06:34,582 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:34,582 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:06:34,945 INFO L124 PetriNetUnfolderBase]: 2708/7998 cut-off events. [2024-01-27 15:06:34,945 INFO L125 PetriNetUnfolderBase]: For 3359/3571 co-relation queries the response was YES. [2024-01-27 15:06:34,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16968 conditions, 7998 events. 2708/7998 cut-off events. For 3359/3571 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 76704 event pairs, 983 based on Foata normal form. 246/7847 useless extension candidates. Maximal degree in co-relation 16949. Up to 2683 conditions per place. [2024-01-27 15:06:35,003 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 37 selfloop transitions, 11 changer transitions 0/135 dead transitions. [2024-01-27 15:06:35,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 135 transitions, 655 flow [2024-01-27 15:06:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:06:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:06:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 340 transitions. [2024-01-27 15:06:35,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7640449438202247 [2024-01-27 15:06:35,006 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 508 flow. Second operand 5 states and 340 transitions. [2024-01-27 15:06:35,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 135 transitions, 655 flow [2024-01-27 15:06:35,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 651 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-27 15:06:35,025 INFO L231 Difference]: Finished difference. Result has 111 places, 118 transitions, 561 flow [2024-01-27 15:06:35,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=111, PETRI_TRANSITIONS=118} [2024-01-27 15:06:35,027 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 37 predicate places. [2024-01-27 15:06:35,027 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 118 transitions, 561 flow [2024-01-27 15:06:35,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-01-27 15:06:35,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:35,028 INFO L208 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] [2024-01-27 15:06:35,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:06:35,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 15:06:35,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -895851414, now seen corresponding path program 1 times [2024-01-27 15:06:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:35,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506511855] [2024-01-27 15:06:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:35,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:35,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506511855] [2024-01-27 15:06:35,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506511855] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:35,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:35,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:06:35,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350810916] [2024-01-27 15:06:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:35,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:06:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:35,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:06:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:06:35,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 89 [2024-01-27 15:06:35,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 118 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-01-27 15:06:35,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:35,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 89 [2024-01-27 15:06:35,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:35,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res.base_1| 0) (= |v_thr2Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_1|, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_#res.offset][85], [Black: 124#(= ~x~0 1), Black: 127#(and (= thr2Thread1of1ForFork0_~x2~0 1) (= ~x~0 1)), Black: 125#(= thr2Thread1of1ForFork0_~x2~0 1), 114#(= 2 ~x~0), 102#true, 66#L707true, 50#thr2EXITtrue, Black: 137#(and (= thr1Thread1of1ForFork1_~b21~0 1) (= ~b2~0 1)), Black: 135#(= thr1Thread1of1ForFork1_~b21~0 1), Black: 134#(= ~b2~0 1), thr2Thread1of1ForFork0InUse, 81#true, 90#(= ~X~0 1), Black: 85#(= ~X~0 0), 39#L847-1true, 92#true, Black: 97#(and (= thr2Thread1of1ForFork0_~y2~0 1) (= ~y~0 1)), 132#true, Black: 94#(= ~y~0 1), 122#true, Black: 104#(= 2 ~y~0), Black: 107#(and (= 2 thr1Thread1of1ForFork1_~y1~0) (= 2 ~y~0)), 143#(= ~b1~0 1), Black: 115#(= 2 thr1Thread1of1ForFork1_~x1~0), Black: 112#true, Black: 117#(and (= 2 ~x~0) (= 2 thr1Thread1of1ForFork1_~x1~0))]) [2024-01-27 15:06:35,517 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:06:35,518 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:06:35,518 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:06:35,518 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-27 15:06:35,946 INFO L124 PetriNetUnfolderBase]: 2291/7005 cut-off events. [2024-01-27 15:06:35,947 INFO L125 PetriNetUnfolderBase]: For 3407/3556 co-relation queries the response was YES. [2024-01-27 15:06:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15606 conditions, 7005 events. 2291/7005 cut-off events. For 3407/3556 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 66475 event pairs, 817 based on Foata normal form. 211/6933 useless extension candidates. Maximal degree in co-relation 15583. Up to 2176 conditions per place. [2024-01-27 15:06:35,975 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 0 selfloop transitions, 0 changer transitions 137/137 dead transitions. [2024-01-27 15:06:35,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 137 transitions, 690 flow [2024-01-27 15:06:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:06:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:06:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2024-01-27 15:06:35,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7685393258426966 [2024-01-27 15:06:35,977 INFO L175 Difference]: Start difference. First operand has 111 places, 118 transitions, 561 flow. Second operand 5 states and 342 transitions. [2024-01-27 15:06:35,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 137 transitions, 690 flow [2024-01-27 15:06:35,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 137 transitions, 680 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-27 15:06:36,000 INFO L231 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2024-01-27 15:06:36,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2024-01-27 15:06:36,001 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 36 predicate places. [2024-01-27 15:06:36,001 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2024-01-27 15:06:36,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-01-27 15:06:36,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 15:06:36,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 15:06:36,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 15:06:36,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-01-27 15:06:36,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-01-27 15:06:36,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 15:06:36,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 15:06:36,006 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-01-27 15:06:36,011 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 15:06:36,011 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 15:06:36,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 03:06:36 BasicIcfg [2024-01-27 15:06:36,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 15:06:36,016 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 15:06:36,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 15:06:36,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 15:06:36,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:06:29" (3/4) ... [2024-01-27 15:06:36,018 INFO L137 WitnessPrinter]: Generating witness for correct program [2024-01-27 15:06:36,021 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-01-27 15:06:36,021 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-01-27 15:06:36,024 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-01-27 15:06:36,024 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-01-27 15:06:36,024 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-01-27 15:06:36,024 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-01-27 15:06:36,095 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 15:06:36,095 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-01-27 15:06:36,095 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 15:06:36,096 INFO L158 Benchmark]: Toolchain (without parser) took 7397.26ms. Allocated memory was 159.4MB in the beginning and 796.9MB in the end (delta: 637.5MB). Free memory was 104.5MB in the beginning and 555.7MB in the end (delta: -451.2MB). Peak memory consumption was 189.2MB. Max. memory is 16.1GB. [2024-01-27 15:06:36,096 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:06:36,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.09ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 82.8MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 15:06:36,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.41ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:06:36,097 INFO L158 Benchmark]: Boogie Preprocessor took 89.96ms. Allocated memory is still 159.4MB. Free memory was 80.7MB in the beginning and 78.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:06:36,097 INFO L158 Benchmark]: RCFGBuilder took 479.51ms. Allocated memory is still 159.4MB. Free memory was 78.2MB in the beginning and 123.5MB in the end (delta: -45.4MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-01-27 15:06:36,098 INFO L158 Benchmark]: TraceAbstraction took 6152.56ms. Allocated memory was 159.4MB in the beginning and 796.9MB in the end (delta: 637.5MB). Free memory was 122.8MB in the beginning and 559.9MB in the end (delta: -437.1MB). Peak memory consumption was 363.7MB. Max. memory is 16.1GB. [2024-01-27 15:06:36,098 INFO L158 Benchmark]: Witness Printer took 79.05ms. Allocated memory is still 796.9MB. Free memory was 559.9MB in the beginning and 555.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:06:36,099 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.16ms. Allocated memory is still 159.4MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.09ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 82.8MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.41ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.96ms. Allocated memory is still 159.4MB. Free memory was 80.7MB in the beginning and 78.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.51ms. Allocated memory is still 159.4MB. Free memory was 78.2MB in the beginning and 123.5MB in the end (delta: -45.4MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6152.56ms. Allocated memory was 159.4MB in the beginning and 796.9MB in the end (delta: 637.5MB). Free memory was 122.8MB in the beginning and 559.9MB in the end (delta: -437.1MB). Peak memory consumption was 363.7MB. Max. memory is 16.1GB. * Witness Printer took 79.05ms. Allocated memory is still 796.9MB. Free memory was 559.9MB in the beginning and 555.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 834]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 764]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 816 IncrementalHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 54 mSDtfsCounter, 816 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=561occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-27 15:06:36,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE