./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/ldv-races/race-3_1-container_of-global.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 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:23:10,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:23:10,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:23:10,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:23:10,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:23:10,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:23:10,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:23:10,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:23:10,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:23:10,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:23:10,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:23:10,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:23:10,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:23:10,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:23:10,767 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:23:10,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:23:10,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:23:10,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:23:10,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:23:10,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:23:10,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:23:10,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:23:10,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:23:10,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:23:10,769 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:23:10,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:23:10,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:23:10,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:23:10,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:23:10,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:23:10,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:23:10,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:23:10,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:23:10,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:23:10,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:23:10,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:23:10,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:23:10,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:23:10,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:23:10,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:23:10,773 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:23:10,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:23:10,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:23:10,773 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 -> 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece [2024-06-27 16:23:11,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:23:11,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:23:11,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:23:11,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:23:11,028 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:23:11,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2024-06-27 16:23:12,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:23:12,244 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:23:12,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2024-06-27 16:23:12,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02fae71ec/c0ba319e519247f4addee32831d95be4/FLAGb760c9701 [2024-06-27 16:23:12,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02fae71ec/c0ba319e519247f4addee32831d95be4 [2024-06-27 16:23:12,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:23:12,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:23:12,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:23:12,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:23:12,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:23:12,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a09593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12, skipping insertion in model container [2024-06-27 16:23:12,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,337 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:23:12,651 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[186210,186223] [2024-06-27 16:23:12,679 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:23:12,686 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:23:12,725 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[186210,186223] [2024-06-27 16:23:12,737 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:23:12,776 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:23:12,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12 WrapperNode [2024-06-27 16:23:12,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:23:12,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:23:12,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:23:12,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:23:12,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,829 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2024-06-27 16:23:12,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:23:12,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:23:12,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:23:12,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:23:12,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,922 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-06-27 16:23:12,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:23:12,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:23:12,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:23:12,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:23:12,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (1/1) ... [2024-06-27 16:23:12,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:23:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:23:13,008 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-06-27 16:23:13,017 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-06-27 16:23:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-06-27 16:23:13,048 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-06-27 16:23:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-27 16:23:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-27 16:23:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 16:23:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:23:13,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:23:13,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 16:23:13,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:23:13,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:23:13,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 16:23:13,051 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 16:23:13,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:23:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-27 16:23:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-27 16:23:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-27 16:23:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:23:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:23:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 16:23:13,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:23:13,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:23:13,055 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:23:13,321 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:23:13,323 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:23:13,541 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:23:13,541 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:23:13,630 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:23:13,631 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 16:23:13,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:23:13 BoogieIcfgContainer [2024-06-27 16:23:13,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:23:13,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:23:13,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:23:13,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:23:13,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:23:12" (1/3) ... [2024-06-27 16:23:13,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d2dbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:23:13, skipping insertion in model container [2024-06-27 16:23:13,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:23:12" (2/3) ... [2024-06-27 16:23:13,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d2dbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:23:13, skipping insertion in model container [2024-06-27 16:23:13,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:23:13" (3/3) ... [2024-06-27 16:23:13,639 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2024-06-27 16:23:13,645 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:23:13,651 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:23:13,651 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-27 16:23:13,651 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:23:13,701 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:23:13,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2024-06-27 16:23:13,761 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2024-06-27 16:23:13,768 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:23:13,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2024-06-27 16:23:13,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2024-06-27 16:23:13,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2024-06-27 16:23:13,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:23:13,787 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;@4cbffe6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:23:13,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 16:23:13,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:23:13,789 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2024-06-27 16:23:13,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:23:13,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:13,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-06-27 16:23:13,790 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:13,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash 13064660, now seen corresponding path program 1 times [2024-06-27 16:23:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:13,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550941704] [2024-06-27 16:23:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550941704] [2024-06-27 16:23:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550941704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:23:14,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650645335] [2024-06-27 16:23:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:14,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:23:14,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:14,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:23:14,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:23:14,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:14,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06-27 16:23:14,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:14,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:14,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:14,472 INFO L124 PetriNetUnfolderBase]: 466/823 cut-off events. [2024-06-27 16:23:14,473 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-27 16:23:14,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 823 events. 466/823 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3426 event pairs, 345 based on Foata normal form. 3/822 useless extension candidates. Maximal degree in co-relation 1538. Up to 602 conditions per place. [2024-06-27 16:23:14,482 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-27 16:23:14,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2024-06-27 16:23:14,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:23:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:23:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-06-27 16:23:14,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 16:23:14,496 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2024-06-27 16:23:14,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2024-06-27 16:23:14,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 16:23:14,504 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2024-06-27 16:23:14,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-06-27 16:23:14,508 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2024-06-27 16:23:14,508 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2024-06-27 16:23:14,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-06-27 16:23:14,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:14,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 16:23:14,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:23:14,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:14,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:14,510 INFO L85 PathProgramCache]: Analyzing trace with hash -329692165, now seen corresponding path program 1 times [2024-06-27 16:23:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640923216] [2024-06-27 16:23:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640923216] [2024-06-27 16:23:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640923216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:14,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:23:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58103195] [2024-06-27 16:23:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:14,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:23:14,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:23:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:23:14,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:14,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-06-27 16:23:14,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:14,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:14,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:14,808 INFO L124 PetriNetUnfolderBase]: 466/821 cut-off events. [2024-06-27 16:23:14,809 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-27 16:23:14,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 821 events. 466/821 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3457 event pairs, 155 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 818. Up to 553 conditions per place. [2024-06-27 16:23:14,813 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 47 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2024-06-27 16:23:14,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 265 flow [2024-06-27 16:23:14,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:23:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:23:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-06-27 16:23:14,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2024-06-27 16:23:14,814 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 109 transitions. [2024-06-27 16:23:14,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 265 flow [2024-06-27 16:23:14,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:23:14,816 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2024-06-27 16:23:14,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-06-27 16:23:14,817 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-06-27 16:23:14,817 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2024-06-27 16:23:14,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-06-27 16:23:14,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:14,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:23:14,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:23:14,818 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:14,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2019603849, now seen corresponding path program 1 times [2024-06-27 16:23:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:14,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37265147] [2024-06-27 16:23:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:14,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37265147] [2024-06-27 16:23:14,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37265147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:14,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:23:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121679976] [2024-06-27 16:23:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:14,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:23:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:14,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:23:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:23:14,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:14,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-06-27 16:23:14,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:14,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:14,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:15,123 INFO L124 PetriNetUnfolderBase]: 562/1026 cut-off events. [2024-06-27 16:23:15,123 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2024-06-27 16:23:15,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 1026 events. 562/1026 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4860 event pairs, 252 based on Foata normal form. 64/1089 useless extension candidates. Maximal degree in co-relation 274. Up to 545 conditions per place. [2024-06-27 16:23:15,129 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 49 selfloop transitions, 10 changer transitions 4/67 dead transitions. [2024-06-27 16:23:15,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2024-06-27 16:23:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:23:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:23:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-06-27 16:23:15,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-27 16:23:15,130 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2024-06-27 16:23:15,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2024-06-27 16:23:15,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 16:23:15,132 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 150 flow [2024-06-27 16:23:15,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-06-27 16:23:15,133 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-06-27 16:23:15,133 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 150 flow [2024-06-27 16:23:15,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-06-27 16:23:15,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:15,133 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] [2024-06-27 16:23:15,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:23:15,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:15,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1257070099, now seen corresponding path program 1 times [2024-06-27 16:23:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:15,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184869219] [2024-06-27 16:23:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:15,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184869219] [2024-06-27 16:23:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184869219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:23:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922609911] [2024-06-27 16:23:15,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:15,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:23:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:23:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:23:15,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-06-27 16:23:15,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:23:15,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:15,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-06-27 16:23:15,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:15,317 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2024-06-27 16:23:15,318 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2024-06-27 16:23:15,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 408 events. 225/408 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1450 event pairs, 46 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 927. Up to 217 conditions per place. [2024-06-27 16:23:15,319 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-06-27 16:23:15,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 278 flow [2024-06-27 16:23:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:23:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:23:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-06-27 16:23:15,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2024-06-27 16:23:15,321 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 150 flow. Second operand 4 states and 131 transitions. [2024-06-27 16:23:15,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 278 flow [2024-06-27 16:23:15,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 248 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 16:23:15,322 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 96 flow [2024-06-27 16:23:15,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2024-06-27 16:23:15,323 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2024-06-27 16:23:15,323 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 96 flow [2024-06-27 16:23:15,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:23:15,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:15,324 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] [2024-06-27 16:23:15,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:23:15,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:15,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash -660184073, now seen corresponding path program 1 times [2024-06-27 16:23:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:15,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302275528] [2024-06-27 16:23:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:15,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:15,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302275528] [2024-06-27 16:23:15,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302275528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:15,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:15,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:23:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367509509] [2024-06-27 16:23:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:15,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:23:15,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:15,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:23:15,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:23:15,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-06-27 16:23:15,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-06-27 16:23:15,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:15,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-06-27 16:23:15,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:15,767 INFO L124 PetriNetUnfolderBase]: 251/458 cut-off events. [2024-06-27 16:23:15,767 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2024-06-27 16:23:15,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 458 events. 251/458 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1775 event pairs, 35 based on Foata normal form. 8/465 useless extension candidates. Maximal degree in co-relation 219. Up to 271 conditions per place. [2024-06-27 16:23:15,769 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 56 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2024-06-27 16:23:15,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 332 flow [2024-06-27 16:23:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:23:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:23:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-06-27 16:23:15,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-06-27 16:23:15,782 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 96 flow. Second operand 5 states and 164 transitions. [2024-06-27 16:23:15,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 332 flow [2024-06-27 16:23:15,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:23:15,786 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 126 flow [2024-06-27 16:23:15,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-27 16:23:15,789 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2024-06-27 16:23:15,789 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 126 flow [2024-06-27 16:23:15,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-06-27 16:23:15,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:15,790 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] [2024-06-27 16:23:15,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:23:15,790 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:15,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1426301679, now seen corresponding path program 2 times [2024-06-27 16:23:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:15,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614908960] [2024-06-27 16:23:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614908960] [2024-06-27 16:23:16,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614908960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:16,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:16,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:23:16,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129046030] [2024-06-27 16:23:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:16,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:23:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:23:16,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:23:16,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-06-27 16:23:16,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-06-27 16:23:16,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:16,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-06-27 16:23:16,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:16,294 INFO L124 PetriNetUnfolderBase]: 281/516 cut-off events. [2024-06-27 16:23:16,294 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2024-06-27 16:23:16,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 516 events. 281/516 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2048 event pairs, 37 based on Foata normal form. 8/523 useless extension candidates. Maximal degree in co-relation 354. Up to 307 conditions per place. [2024-06-27 16:23:16,297 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 58 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2024-06-27 16:23:16,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 378 flow [2024-06-27 16:23:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:23:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:23:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-06-27 16:23:16,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-06-27 16:23:16,298 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 126 flow. Second operand 5 states and 164 transitions. [2024-06-27 16:23:16,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 378 flow [2024-06-27 16:23:16,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:23:16,301 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 172 flow [2024-06-27 16:23:16,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-06-27 16:23:16,303 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-06-27 16:23:16,303 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 172 flow [2024-06-27 16:23:16,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-06-27 16:23:16,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:16,304 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] [2024-06-27 16:23:16,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:23:16,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:16,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -368074777, now seen corresponding path program 3 times [2024-06-27 16:23:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:16,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811312441] [2024-06-27 16:23:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:16,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811312441] [2024-06-27 16:23:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811312441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:16,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:16,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 16:23:16,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363583089] [2024-06-27 16:23:16,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:16,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:23:16,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:16,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:23:16,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:23:16,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:16,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-06-27 16:23:16,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:16,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:16,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:16,953 INFO L124 PetriNetUnfolderBase]: 324/607 cut-off events. [2024-06-27 16:23:16,953 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2024-06-27 16:23:16,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 607 events. 324/607 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2452 event pairs, 38 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 696. Up to 171 conditions per place. [2024-06-27 16:23:16,956 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 82 selfloop transitions, 23 changer transitions 0/107 dead transitions. [2024-06-27 16:23:16,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 107 transitions, 682 flow [2024-06-27 16:23:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 16:23:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 16:23:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 201 transitions. [2024-06-27 16:23:16,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2791666666666667 [2024-06-27 16:23:16,958 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 172 flow. Second operand 12 states and 201 transitions. [2024-06-27 16:23:16,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 107 transitions, 682 flow [2024-06-27 16:23:16,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 674 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 16:23:16,961 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 288 flow [2024-06-27 16:23:16,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=288, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-27 16:23:16,961 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-06-27 16:23:16,962 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 288 flow [2024-06-27 16:23:16,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-06-27 16:23:16,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:16,962 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] [2024-06-27 16:23:16,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:23:16,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:16,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:16,963 INFO L85 PathProgramCache]: Analyzing trace with hash -786765451, now seen corresponding path program 4 times [2024-06-27 16:23:16,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:16,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833505563] [2024-06-27 16:23:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:16,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833505563] [2024-06-27 16:23:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833505563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:23:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535796735] [2024-06-27 16:23:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:17,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:23:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:23:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:23:17,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-06-27 16:23:17,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-06-27 16:23:17,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:17,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-06-27 16:23:17,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:17,383 INFO L124 PetriNetUnfolderBase]: 437/848 cut-off events. [2024-06-27 16:23:17,384 INFO L125 PetriNetUnfolderBase]: For 1437/1437 co-relation queries the response was YES. [2024-06-27 16:23:17,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 848 events. 437/848 cut-off events. For 1437/1437 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4078 event pairs, 115 based on Foata normal form. 16/864 useless extension candidates. Maximal degree in co-relation 2881. Up to 515 conditions per place. [2024-06-27 16:23:17,388 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 87 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2024-06-27 16:23:17,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 750 flow [2024-06-27 16:23:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:23:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:23:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-06-27 16:23:17,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5766666666666667 [2024-06-27 16:23:17,392 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 288 flow. Second operand 5 states and 173 transitions. [2024-06-27 16:23:17,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 750 flow [2024-06-27 16:23:17,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 725 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 16:23:17,396 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 370 flow [2024-06-27 16:23:17,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2024-06-27 16:23:17,397 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2024-06-27 16:23:17,397 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 370 flow [2024-06-27 16:23:17,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-06-27 16:23:17,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:17,398 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] [2024-06-27 16:23:17,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:23:17,398 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:17,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1783290199, now seen corresponding path program 5 times [2024-06-27 16:23:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478270157] [2024-06-27 16:23:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:17,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478270157] [2024-06-27 16:23:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478270157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:17,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:17,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 16:23:17,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703740436] [2024-06-27 16:23:17,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:17,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:23:17,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:17,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:23:17,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:23:17,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:17,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-06-27 16:23:17,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:17,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:17,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:17,977 INFO L124 PetriNetUnfolderBase]: 437/844 cut-off events. [2024-06-27 16:23:17,977 INFO L125 PetriNetUnfolderBase]: For 2287/2287 co-relation queries the response was YES. [2024-06-27 16:23:17,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3182 conditions, 844 events. 437/844 cut-off events. For 2287/2287 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4009 event pairs, 45 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 3139. Up to 246 conditions per place. [2024-06-27 16:23:17,983 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 93 selfloop transitions, 27 changer transitions 0/121 dead transitions. [2024-06-27 16:23:17,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 1017 flow [2024-06-27 16:23:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 16:23:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 16:23:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions. [2024-06-27 16:23:17,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28055555555555556 [2024-06-27 16:23:17,984 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 370 flow. Second operand 12 states and 202 transitions. [2024-06-27 16:23:17,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 1017 flow [2024-06-27 16:23:17,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 121 transitions, 995 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 16:23:17,991 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 465 flow [2024-06-27 16:23:17,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=465, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-06-27 16:23:17,992 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2024-06-27 16:23:17,992 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 465 flow [2024-06-27 16:23:17,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-06-27 16:23:17,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:17,992 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] [2024-06-27 16:23:17,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:23:17,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:17,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -170966216, now seen corresponding path program 1 times [2024-06-27 16:23:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205283741] [2024-06-27 16:23:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205283741] [2024-06-27 16:23:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205283741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 16:23:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136845903] [2024-06-27 16:23:18,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:18,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 16:23:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:18,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 16:23:18,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:23:18,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:18,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 465 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-06-27 16:23:18,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:18,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:18,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:19,080 INFO L124 PetriNetUnfolderBase]: 437/842 cut-off events. [2024-06-27 16:23:19,080 INFO L125 PetriNetUnfolderBase]: For 2801/2801 co-relation queries the response was YES. [2024-06-27 16:23:19,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 842 events. 437/842 cut-off events. For 2801/2801 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3923 event pairs, 82 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 2470. Up to 368 conditions per place. [2024-06-27 16:23:19,085 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 72 selfloop transitions, 32 changer transitions 27/132 dead transitions. [2024-06-27 16:23:19,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 1200 flow [2024-06-27 16:23:19,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 16:23:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 16:23:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 232 transitions. [2024-06-27 16:23:19,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2761904761904762 [2024-06-27 16:23:19,087 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 465 flow. Second operand 14 states and 232 transitions. [2024-06-27 16:23:19,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 1200 flow [2024-06-27 16:23:19,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 132 transitions, 1148 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 16:23:19,096 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 685 flow [2024-06-27 16:23:19,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=685, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2024-06-27 16:23:19,098 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2024-06-27 16:23:19,098 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 685 flow [2024-06-27 16:23:19,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-06-27 16:23:19,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:19,099 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] [2024-06-27 16:23:19,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 16:23:19,099 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:19,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -343838380, now seen corresponding path program 2 times [2024-06-27 16:23:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636827477] [2024-06-27 16:23:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:19,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636827477] [2024-06-27 16:23:19,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636827477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:19,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:19,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 16:23:19,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313127876] [2024-06-27 16:23:19,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:19,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 16:23:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:19,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 16:23:19,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 16:23:19,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:19,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 685 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-06-27 16:23:19,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:19,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:19,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:20,231 INFO L124 PetriNetUnfolderBase]: 377/746 cut-off events. [2024-06-27 16:23:20,231 INFO L125 PetriNetUnfolderBase]: For 2817/2817 co-relation queries the response was YES. [2024-06-27 16:23:20,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 746 events. 377/746 cut-off events. For 2817/2817 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3387 event pairs, 66 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 3094. Up to 410 conditions per place. [2024-06-27 16:23:20,235 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 68 selfloop transitions, 28 changer transitions 32/129 dead transitions. [2024-06-27 16:23:20,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 129 transitions, 1242 flow [2024-06-27 16:23:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 16:23:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 16:23:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 217 transitions. [2024-06-27 16:23:20,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2782051282051282 [2024-06-27 16:23:20,237 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 685 flow. Second operand 13 states and 217 transitions. [2024-06-27 16:23:20,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 129 transitions, 1242 flow [2024-06-27 16:23:20,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 129 transitions, 1135 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-27 16:23:20,248 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 637 flow [2024-06-27 16:23:20,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=637, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2024-06-27 16:23:20,248 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2024-06-27 16:23:20,249 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 637 flow [2024-06-27 16:23:20,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-06-27 16:23:20,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:20,249 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] [2024-06-27 16:23:20,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:23:20,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:20,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1234976944, now seen corresponding path program 3 times [2024-06-27 16:23:20,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:20,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032587327] [2024-06-27 16:23:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:21,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032587327] [2024-06-27 16:23:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032587327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:21,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 16:23:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326535522] [2024-06-27 16:23:21,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:21,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 16:23:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:21,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 16:23:21,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:23:21,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:21,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 637 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-06-27 16:23:21,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:21,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:21,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:21,496 INFO L124 PetriNetUnfolderBase]: 295/584 cut-off events. [2024-06-27 16:23:21,497 INFO L125 PetriNetUnfolderBase]: For 2029/2029 co-relation queries the response was YES. [2024-06-27 16:23:21,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 584 events. 295/584 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2426 event pairs, 58 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 2387. Up to 301 conditions per place. [2024-06-27 16:23:21,500 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 58 selfloop transitions, 26 changer transitions 27/112 dead transitions. [2024-06-27 16:23:21,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 112 transitions, 1053 flow [2024-06-27 16:23:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 16:23:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 16:23:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 228 transitions. [2024-06-27 16:23:21,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2024-06-27 16:23:21,502 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 637 flow. Second operand 14 states and 228 transitions. [2024-06-27 16:23:21,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 112 transitions, 1053 flow [2024-06-27 16:23:21,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 994 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-27 16:23:21,508 INFO L231 Difference]: Finished difference. Result has 93 places, 67 transitions, 579 flow [2024-06-27 16:23:21,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=579, PETRI_PLACES=93, PETRI_TRANSITIONS=67} [2024-06-27 16:23:21,509 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2024-06-27 16:23:21,509 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 67 transitions, 579 flow [2024-06-27 16:23:21,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-06-27 16:23:21,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:21,509 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] [2024-06-27 16:23:21,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 16:23:21,509 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:21,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash 302187456, now seen corresponding path program 4 times [2024-06-27 16:23:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:21,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481634014] [2024-06-27 16:23:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:22,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:22,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481634014] [2024-06-27 16:23:22,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481634014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:22,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:22,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 16:23:22,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087481125] [2024-06-27 16:23:22,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:22,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 16:23:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:22,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 16:23:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:23:22,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:22,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 67 transitions, 579 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-06-27 16:23:22,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:22,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:22,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:22,412 INFO L124 PetriNetUnfolderBase]: 228/449 cut-off events. [2024-06-27 16:23:22,412 INFO L125 PetriNetUnfolderBase]: For 1654/1654 co-relation queries the response was YES. [2024-06-27 16:23:22,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 449 events. 228/449 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1691 event pairs, 36 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 1899. Up to 237 conditions per place. [2024-06-27 16:23:22,415 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 45 selfloop transitions, 16 changer transitions 36/98 dead transitions. [2024-06-27 16:23:22,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 98 transitions, 920 flow [2024-06-27 16:23:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 16:23:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 16:23:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2024-06-27 16:23:22,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2024-06-27 16:23:22,417 INFO L175 Difference]: Start difference. First operand has 93 places, 67 transitions, 579 flow. Second operand 14 states and 220 transitions. [2024-06-27 16:23:22,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 98 transitions, 920 flow [2024-06-27 16:23:22,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 804 flow, removed 3 selfloop flow, removed 15 redundant places. [2024-06-27 16:23:22,422 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 371 flow [2024-06-27 16:23:22,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=371, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2024-06-27 16:23:22,423 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2024-06-27 16:23:22,423 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 371 flow [2024-06-27 16:23:22,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-06-27 16:23:22,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:22,424 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] [2024-06-27 16:23:22,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 16:23:22,424 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:22,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:22,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1301090480, now seen corresponding path program 5 times [2024-06-27 16:23:22,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:22,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268601626] [2024-06-27 16:23:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:22,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:22,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268601626] [2024-06-27 16:23:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268601626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:22,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:22,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:23:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129855460] [2024-06-27 16:23:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:22,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:23:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:22,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:23:22,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:23:22,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-06-27 16:23:22,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-06-27 16:23:22,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:22,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-06-27 16:23:22,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:22,760 INFO L124 PetriNetUnfolderBase]: 97/204 cut-off events. [2024-06-27 16:23:22,760 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-06-27 16:23:22,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 204 events. 97/204 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 575 event pairs, 9 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 816. Up to 96 conditions per place. [2024-06-27 16:23:22,762 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 45 selfloop transitions, 14 changer transitions 0/64 dead transitions. [2024-06-27 16:23:22,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 64 transitions, 533 flow [2024-06-27 16:23:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:23:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:23:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-06-27 16:23:22,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2024-06-27 16:23:22,763 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 371 flow. Second operand 5 states and 154 transitions. [2024-06-27 16:23:22,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 64 transitions, 533 flow [2024-06-27 16:23:22,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 421 flow, removed 16 selfloop flow, removed 18 redundant places. [2024-06-27 16:23:22,765 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 311 flow [2024-06-27 16:23:22,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2024-06-27 16:23:22,766 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2024-06-27 16:23:22,766 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 311 flow [2024-06-27 16:23:22,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-06-27 16:23:22,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:22,767 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] [2024-06-27 16:23:22,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 16:23:22,767 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:22,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash 50014096, now seen corresponding path program 6 times [2024-06-27 16:23:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:22,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418489140] [2024-06-27 16:23:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:23,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:23,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418489140] [2024-06-27 16:23:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418489140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:23,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 16:23:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695352102] [2024-06-27 16:23:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:23,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 16:23:23,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 16:23:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 16:23:23,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:23,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 311 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-06-27 16:23:23,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:23,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:23,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:23,686 INFO L124 PetriNetUnfolderBase]: 144/303 cut-off events. [2024-06-27 16:23:23,686 INFO L125 PetriNetUnfolderBase]: For 767/767 co-relation queries the response was YES. [2024-06-27 16:23:23,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 303 events. 144/303 cut-off events. For 767/767 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 995 event pairs, 5 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 739. Up to 71 conditions per place. [2024-06-27 16:23:23,688 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 37 selfloop transitions, 14 changer transitions 30/82 dead transitions. [2024-06-27 16:23:23,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 82 transitions, 599 flow [2024-06-27 16:23:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 16:23:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 16:23:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2024-06-27 16:23:23,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25256410256410255 [2024-06-27 16:23:23,691 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 311 flow. Second operand 13 states and 197 transitions. [2024-06-27 16:23:23,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 82 transitions, 599 flow [2024-06-27 16:23:23,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 82 transitions, 558 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 16:23:23,694 INFO L231 Difference]: Finished difference. Result has 73 places, 43 transitions, 241 flow [2024-06-27 16:23:23,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=241, PETRI_PLACES=73, PETRI_TRANSITIONS=43} [2024-06-27 16:23:23,695 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2024-06-27 16:23:23,695 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 43 transitions, 241 flow [2024-06-27 16:23:23,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-06-27 16:23:23,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:23:23,696 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] [2024-06-27 16:23:23,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 16:23:23,696 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 16:23:23,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:23:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash -302123464, now seen corresponding path program 7 times [2024-06-27 16:23:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:23:23,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701989119] [2024-06-27 16:23:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:23:23,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:23:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:23:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:23:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:23:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701989119] [2024-06-27 16:23:24,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701989119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:23:24,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:23:24,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 16:23:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596427503] [2024-06-27 16:23:24,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:23:24,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 16:23:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:23:24,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 16:23:24,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:23:24,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 16:23:24,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 43 transitions, 241 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-06-27 16:23:24,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:23:24,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 16:23:24,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:23:24,470 INFO L124 PetriNetUnfolderBase]: 76/169 cut-off events. [2024-06-27 16:23:24,470 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-06-27 16:23:24,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 169 events. 76/169 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 426 event pairs, 4 based on Foata normal form. 1/170 useless extension candidates. Maximal degree in co-relation 587. Up to 62 conditions per place. [2024-06-27 16:23:24,471 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2024-06-27 16:23:24,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 54 transitions, 393 flow [2024-06-27 16:23:24,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 16:23:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 16:23:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 181 transitions. [2024-06-27 16:23:24,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23205128205128206 [2024-06-27 16:23:24,472 INFO L175 Difference]: Start difference. First operand has 73 places, 43 transitions, 241 flow. Second operand 13 states and 181 transitions. [2024-06-27 16:23:24,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 54 transitions, 393 flow [2024-06-27 16:23:24,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 323 flow, removed 0 selfloop flow, removed 18 redundant places. [2024-06-27 16:23:24,474 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2024-06-27 16:23:24,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2024-06-27 16:23:24,474 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2024-06-27 16:23:24,474 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 0 transitions, 0 flow [2024-06-27 16:23:24,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-06-27 16:23:24,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-06-27 16:23:24,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-06-27 16:23:24,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-06-27 16:23:24,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-06-27 16:23:24,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-06-27 16:23:24,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-06-27 16:23:24,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-27 16:23:24,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-27 16:23:24,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 16:23:24,478 INFO L445 BasicCegarLoop]: Path program histogram: [7, 5, 1, 1, 1, 1] [2024-06-27 16:23:24,481 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 16:23:24,481 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 16:23:24,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 04:23:24 BasicIcfg [2024-06-27 16:23:24,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 16:23:24,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 16:23:24,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 16:23:24,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 16:23:24,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:23:13" (3/4) ... [2024-06-27 16:23:24,489 INFO L137 WitnessPrinter]: Generating witness for correct program [2024-06-27 16:23:24,492 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2024-06-27 16:23:24,501 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2024-06-27 16:23:24,501 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2024-06-27 16:23:24,501 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-06-27 16:23:24,502 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-06-27 16:23:24,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 16:23:24,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-06-27 16:23:24,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 16:23:24,594 INFO L158 Benchmark]: Toolchain (without parser) took 12314.77ms. Allocated memory was 176.2MB in the beginning and 541.1MB in the end (delta: 364.9MB). Free memory was 103.2MB in the beginning and 459.7MB in the end (delta: -356.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-06-27 16:23:24,594 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:23:24,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.20ms. Allocated memory is still 176.2MB. Free memory was 102.9MB in the beginning and 67.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-06-27 16:23:24,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.45ms. Allocated memory is still 176.2MB. Free memory was 67.1MB in the beginning and 64.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:23:24,597 INFO L158 Benchmark]: Boogie Preprocessor took 135.51ms. Allocated memory is still 176.2MB. Free memory was 64.5MB in the beginning and 141.9MB in the end (delta: -77.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-27 16:23:24,597 INFO L158 Benchmark]: RCFGBuilder took 666.61ms. Allocated memory is still 176.2MB. Free memory was 141.9MB in the beginning and 102.5MB in the end (delta: 39.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-06-27 16:23:24,597 INFO L158 Benchmark]: TraceAbstraction took 10852.17ms. Allocated memory was 176.2MB in the beginning and 541.1MB in the end (delta: 364.9MB). Free memory was 101.2MB in the beginning and 466.0MB in the end (delta: -364.8MB). Peak memory consumption was 957.4kB. Max. memory is 16.1GB. [2024-06-27 16:23:24,597 INFO L158 Benchmark]: Witness Printer took 107.04ms. Allocated memory is still 541.1MB. Free memory was 466.0MB in the beginning and 459.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 16:23:24,599 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.20ms. Allocated memory is still 176.2MB. Free memory was 102.9MB in the beginning and 67.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.45ms. Allocated memory is still 176.2MB. Free memory was 67.1MB in the beginning and 64.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.51ms. Allocated memory is still 176.2MB. Free memory was 64.5MB in the beginning and 141.9MB in the end (delta: -77.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 666.61ms. Allocated memory is still 176.2MB. Free memory was 141.9MB in the beginning and 102.5MB in the end (delta: 39.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10852.17ms. Allocated memory was 176.2MB in the beginning and 541.1MB in the end (delta: 364.9MB). Free memory was 101.2MB in the beginning and 466.0MB in the end (delta: -364.8MB). Peak memory consumption was 957.4kB. Max. memory is 16.1GB. * Witness Printer took 107.04ms. Allocated memory is still 541.1MB. Free memory was 466.0MB in the beginning and 459.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3885]: 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: 3885]: 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: 3885]: 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: 3885]: 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: 3885]: 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: 3885]: 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 4 procedures, 60 locations, 8 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: 10.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1109 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1017 mSDsluCounter, 941 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 869 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3899 IncrementalHoareTripleChecker+Invalid, 4063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 72 mSDtfsCounter, 3899 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=685occurred in iteration=10, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 3566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-27 16:23:24,632 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