./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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-2_1-container_of.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 fddded73cca9ade55587111b2e2c843e75dd81397929514bda88fadfc663c7db --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:15:44,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:15:44,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:15:44,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:15:44,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:15:44,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:15:44,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:15:44,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:15:44,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:15:44,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:15:44,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:15:44,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:15:44,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:15:44,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:15:44,802 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:15:44,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:15:44,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:15:44,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:15:44,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:15:44,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:15:44,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:15:44,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:15:44,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:15:44,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:15:44,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:15:44,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:15:44,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:15:44,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:15:44,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:15:44,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:15:44,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:15:44,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:15:44,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:15:44,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:15:44,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:15:44,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:15:44,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:15:44,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:15:44,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:15:44,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:15:44,811 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:15:44,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:15:44,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:15:44,812 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 -> fddded73cca9ade55587111b2e2c843e75dd81397929514bda88fadfc663c7db Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:15:45,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:15:45,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:15:45,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:15:45,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:15:45,098 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:15:45,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2024-02-19 14:15:46,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:15:46,461 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:15:46,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2024-02-19 14:15:46,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed77fb39/24b023be6ea84ea8ab65ae84f33ff5f1/FLAG5cf08968c [2024-02-19 14:15:46,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed77fb39/24b023be6ea84ea8ab65ae84f33ff5f1 [2024-02-19 14:15:46,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:15:46,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:15:46,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:15:46,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:15:46,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:15:46,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:15:46" (1/1) ... [2024-02-19 14:15:46,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240a480b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:46, skipping insertion in model container [2024-02-19 14:15:46,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:15:46" (1/1) ... [2024-02-19 14:15:46,556 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:15:47,103 WARN L239 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-2_1-container_of.i[76077,76090] [2024-02-19 14:15:47,140 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:15:47,149 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:15:47,192 WARN L239 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-2_1-container_of.i[76077,76090] [2024-02-19 14:15:47,207 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:15:47,318 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:15:47,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47 WrapperNode [2024-02-19 14:15:47,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:15:47,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:15:47,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:15:47,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:15:47,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,380 INFO L138 Inliner]: procedures = 483, calls = 47, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2024-02-19 14:15:47,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:15:47,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:15:47,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:15:47,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:15:47,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,408 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 3, 3, 2, 13]. 57 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1, 0, 0]. The 10 writes are split as follows [0, 1, 1, 2, 6]. [2024-02-19 14:15:47,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:15:47,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:15:47,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:15:47,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:15:47,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (1/1) ... [2024-02-19 14:15:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:15:47,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:15:47,480 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-02-19 14:15:47,503 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-02-19 14:15:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:15:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:15:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:15:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:15:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:15:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:15:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-19 14:15:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:15:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-19 14:15:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-19 14:15:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-19 14:15:47,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-19 14:15:47,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-19 14:15:47,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:15:47,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:15:47,542 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-02-19 14:15:47,542 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-02-19 14:15:47,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:15:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-19 14:15:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:15:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:15:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:15:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:15:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:15:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:15:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:15:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:15:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:15:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:15:47,547 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:15:47,747 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:15:47,752 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:15:47,977 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:15:47,977 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:15:48,116 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:15:48,116 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-19 14:15:48,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:15:48 BoogieIcfgContainer [2024-02-19 14:15:48,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:15:48,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:15:48,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:15:48,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:15:48,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:15:46" (1/3) ... [2024-02-19 14:15:48,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8859678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:15:48, skipping insertion in model container [2024-02-19 14:15:48,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:47" (2/3) ... [2024-02-19 14:15:48,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8859678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:15:48, skipping insertion in model container [2024-02-19 14:15:48,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:15:48" (3/3) ... [2024-02-19 14:15:48,124 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2024-02-19 14:15:48,138 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:15:48,139 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-02-19 14:15:48,139 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:15:48,177 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 14:15:48,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2024-02-19 14:15:48,234 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2024-02-19 14:15:48,235 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:15:48,237 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 7. Compared 145 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-02-19 14:15:48,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2024-02-19 14:15:48,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2024-02-19 14:15:48,246 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:15:48,251 INFO L369 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=All, 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;@2013da92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:15:48,251 INFO L370 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-02-19 14:15:48,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:15:48,267 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2024-02-19 14:15:48,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:15:48,267 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:48,268 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-19 14:15:48,268 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:48,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:48,272 INFO L85 PathProgramCache]: Analyzing trace with hash 13592748, now seen corresponding path program 1 times [2024-02-19 14:15:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:48,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724115819] [2024-02-19 14:15:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724115819] [2024-02-19 14:15:48,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724115819] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:48,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:15:48,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107304126] [2024-02-19 14:15:48,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:48,677 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:15:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:48,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:15:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:15:48,713 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:15:48,715 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-02-19 14:15:48,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:48,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:15:48,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:48,880 INFO L124 PetriNetUnfolderBase]: 466/823 cut-off events. [2024-02-19 14:15:48,880 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-19 14:15:48,882 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 3413 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-02-19 14:15:48,886 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-02-19 14:15:48,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2024-02-19 14:15:48,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:15:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:15:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-02-19 14:15:48,895 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-02-19 14:15:48,897 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-02-19 14:15:48,897 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 218 flow [2024-02-19 14:15:48,898 INFO L508 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-02-19 14:15:48,898 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:48,898 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:15:48,898 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:15:48,898 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:48,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash 177760495, now seen corresponding path program 1 times [2024-02-19 14:15:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:48,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144924464] [2024-02-19 14:15:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:48,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:48,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144924464] [2024-02-19 14:15:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144924464] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:48,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:15:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661871488] [2024-02-19 14:15:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:48,996 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:15:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:15:48,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:15:49,010 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:15:49,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 218 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-02-19 14:15:49,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:49,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:15:49,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:49,175 INFO L124 PetriNetUnfolderBase]: 466/821 cut-off events. [2024-02-19 14:15:49,175 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-02-19 14:15:49,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 821 events. 466/821 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3476 event pairs, 155 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 2292. Up to 601 conditions per place. [2024-02-19 14:15:49,180 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 47 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2024-02-19 14:15:49,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 371 flow [2024-02-19 14:15:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:15:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:15:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-02-19 14:15:49,182 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2024-02-19 14:15:49,183 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-02-19 14:15:49,183 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 371 flow [2024-02-19 14:15:49,183 INFO L508 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-02-19 14:15:49,183 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:49,183 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:49,183 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:15:49,184 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:49,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1464707490, now seen corresponding path program 1 times [2024-02-19 14:15:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:49,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049158777] [2024-02-19 14:15:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049158777] [2024-02-19 14:15:49,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049158777] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:49,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:15:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217591593] [2024-02-19 14:15:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:49,357 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:15:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:49,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:15:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:15:49,368 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:15:49,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 371 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-02-19 14:15:49,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:49,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:15:49,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:49,555 INFO L124 PetriNetUnfolderBase]: 562/1032 cut-off events. [2024-02-19 14:15:49,556 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-02-19 14:15:49,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4038 conditions, 1032 events. 562/1032 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4943 event pairs, 119 based on Foata normal form. 64/1093 useless extension candidates. Maximal degree in co-relation 3844. Up to 684 conditions per place. [2024-02-19 14:15:49,561 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 56 selfloop transitions, 10 changer transitions 24/94 dead transitions. [2024-02-19 14:15:49,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 743 flow [2024-02-19 14:15:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:15:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:15:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-02-19 14:15:49,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-02-19 14:15:49,566 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-02-19 14:15:49,566 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 94 transitions, 743 flow [2024-02-19 14:15:49,566 INFO L508 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-02-19 14:15:49,566 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:49,567 INFO L234 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-02-19 14:15:49,567 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:15:49,567 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:49,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:49,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1469555925, now seen corresponding path program 1 times [2024-02-19 14:15:49,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:49,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467178031] [2024-02-19 14:15:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:49,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:49,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467178031] [2024-02-19 14:15:49,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467178031] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:49,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:49,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:15:49,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158055798] [2024-02-19 14:15:49,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:49,639 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:15:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:15:49,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:15:49,641 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-02-19 14:15:49,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 94 transitions, 743 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-02-19 14:15:49,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:49,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-02-19 14:15:49,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:49,772 INFO L124 PetriNetUnfolderBase]: 225/420 cut-off events. [2024-02-19 14:15:49,772 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-02-19 14:15:49,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2109 conditions, 420 events. 225/420 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1395 event pairs, 71 based on Foata normal form. 36/453 useless extension candidates. Maximal degree in co-relation 1862. Up to 409 conditions per place. [2024-02-19 14:15:49,775 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 58 selfloop transitions, 4 changer transitions 11/80 dead transitions. [2024-02-19 14:15:49,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 779 flow [2024-02-19 14:15:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:15:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:15:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-02-19 14:15:49,776 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5366666666666666 [2024-02-19 14:15:49,777 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-02-19 14:15:49,777 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 80 transitions, 779 flow [2024-02-19 14:15:49,777 INFO L508 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-02-19 14:15:49,777 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:49,777 INFO L234 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-02-19 14:15:49,778 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:15:49,778 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:49,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:49,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1242984993, now seen corresponding path program 1 times [2024-02-19 14:15:49,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:49,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223151654] [2024-02-19 14:15:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:50,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223151654] [2024-02-19 14:15:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223151654] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:50,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:15:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874049390] [2024-02-19 14:15:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:50,142 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:15:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:15:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:15:50,143 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:15:50,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 80 transitions, 779 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-02-19 14:15:50,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:50,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:15:50,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:50,534 INFO L124 PetriNetUnfolderBase]: 483/879 cut-off events. [2024-02-19 14:15:50,534 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-02-19 14:15:50,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 879 events. 483/879 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3878 event pairs, 80 based on Foata normal form. 8/882 useless extension candidates. Maximal degree in co-relation 4776. Up to 862 conditions per place. [2024-02-19 14:15:50,540 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 134 selfloop transitions, 36 changer transitions 14/191 dead transitions. [2024-02-19 14:15:50,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 191 transitions, 2260 flow [2024-02-19 14:15:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-19 14:15:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-19 14:15:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 325 transitions. [2024-02-19 14:15:50,541 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-19 14:15:50,542 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-02-19 14:15:50,542 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 191 transitions, 2260 flow [2024-02-19 14:15:50,542 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-02-19 14:15:50,543 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:50,543 INFO L234 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-02-19 14:15:50,543 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:15:50,543 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:50,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1979250095, now seen corresponding path program 2 times [2024-02-19 14:15:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570667864] [2024-02-19 14:15:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:50,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570667864] [2024-02-19 14:15:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570667864] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:50,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:15:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143019863] [2024-02-19 14:15:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:50,944 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:15:50,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:50,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:15:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:15:50,945 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:15:50,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 191 transitions, 2260 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-02-19 14:15:50,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:50,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:15:50,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:51,332 INFO L124 PetriNetUnfolderBase]: 537/981 cut-off events. [2024-02-19 14:15:51,332 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-02-19 14:15:51,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 981 events. 537/981 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4464 event pairs, 83 based on Foata normal form. 8/984 useless extension candidates. Maximal degree in co-relation 6172. Up to 964 conditions per place. [2024-02-19 14:15:51,340 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 226 selfloop transitions, 94 changer transitions 14/341 dead transitions. [2024-02-19 14:15:51,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 341 transitions, 4734 flow [2024-02-19 14:15:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 14:15:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 14:15:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 356 transitions. [2024-02-19 14:15:51,342 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-02-19 14:15:51,342 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-02-19 14:15:51,343 INFO L507 AbstractCegarLoop]: Abstraction has has 78 places, 341 transitions, 4734 flow [2024-02-19 14:15:51,343 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-02-19 14:15:51,343 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:51,343 INFO L234 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-02-19 14:15:51,343 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:15:51,343 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:51,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1064982727, now seen corresponding path program 3 times [2024-02-19 14:15:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:51,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630982348] [2024-02-19 14:15:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630982348] [2024-02-19 14:15:51,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630982348] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:51,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:51,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:15:51,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589405463] [2024-02-19 14:15:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:51,671 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:15:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:15:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:15:51,672 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:15:51,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 341 transitions, 4734 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-02-19 14:15:51,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:51,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:15:51,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:52,017 INFO L124 PetriNetUnfolderBase]: 513/949 cut-off events. [2024-02-19 14:15:52,017 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-02-19 14:15:52,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7548 conditions, 949 events. 513/949 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4338 event pairs, 58 based on Foata normal form. 8/952 useless extension candidates. Maximal degree in co-relation 6796. Up to 932 conditions per place. [2024-02-19 14:15:52,025 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 265 selfloop transitions, 102 changer transitions 14/388 dead transitions. [2024-02-19 14:15:52,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 388 transitions, 6154 flow [2024-02-19 14:15:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 14:15:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 14:15:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 277 transitions. [2024-02-19 14:15:52,026 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.512962962962963 [2024-02-19 14:15:52,027 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2024-02-19 14:15:52,027 INFO L507 AbstractCegarLoop]: Abstraction has has 86 places, 388 transitions, 6154 flow [2024-02-19 14:15:52,027 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-02-19 14:15:52,027 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:52,027 INFO L234 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-02-19 14:15:52,027 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:15:52,028 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:52,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash 483707143, now seen corresponding path program 4 times [2024-02-19 14:15:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:52,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997472445] [2024-02-19 14:15:52,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:52,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:52,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:52,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997472445] [2024-02-19 14:15:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997472445] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:52,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-19 14:15:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850729721] [2024-02-19 14:15:52,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:52,459 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 14:15:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:52,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 14:15:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:15:52,478 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:15:52,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 388 transitions, 6154 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-02-19 14:15:52,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:52,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:15:52,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:52,906 INFO L124 PetriNetUnfolderBase]: 601/1137 cut-off events. [2024-02-19 14:15:52,906 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-02-19 14:15:52,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10153 conditions, 1137 events. 601/1137 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5514 event pairs, 28 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 8994. Up to 1112 conditions per place. [2024-02-19 14:15:52,918 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 334 selfloop transitions, 134 changer transitions 20/490 dead transitions. [2024-02-19 14:15:52,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 490 transitions, 8746 flow [2024-02-19 14:15:52,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 14:15:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 14:15:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2024-02-19 14:15:52,920 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2948717948717949 [2024-02-19 14:15:52,921 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 45 predicate places. [2024-02-19 14:15:52,921 INFO L507 AbstractCegarLoop]: Abstraction has has 98 places, 490 transitions, 8746 flow [2024-02-19 14:15:52,922 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-02-19 14:15:52,922 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:52,922 INFO L234 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-02-19 14:15:52,922 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:15:52,923 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:52,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2102859041, now seen corresponding path program 5 times [2024-02-19 14:15:52,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087105209] [2024-02-19 14:15:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:53,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087105209] [2024-02-19 14:15:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087105209] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:15:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396832303] [2024-02-19 14:15:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:53,227 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:15:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:53,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:15:53,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:15:53,228 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:15:53,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 490 transitions, 8746 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-02-19 14:15:53,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:53,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:15:53,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:53,639 INFO L124 PetriNetUnfolderBase]: 484/946 cut-off events. [2024-02-19 14:15:53,640 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-02-19 14:15:53,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9352 conditions, 946 events. 484/946 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4456 event pairs, 9 based on Foata normal form. 16/955 useless extension candidates. Maximal degree in co-relation 8202. Up to 921 conditions per place. [2024-02-19 14:15:53,649 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 311 selfloop transitions, 90 changer transitions 20/430 dead transitions. [2024-02-19 14:15:53,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 430 transitions, 8498 flow [2024-02-19 14:15:53,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-19 14:15:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-19 14:15:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 329 transitions. [2024-02-19 14:15:53,651 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5483333333333333 [2024-02-19 14:15:53,652 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2024-02-19 14:15:53,652 INFO L507 AbstractCegarLoop]: Abstraction has has 107 places, 430 transitions, 8498 flow [2024-02-19 14:15:53,652 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-02-19 14:15:53,652 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:53,653 INFO L234 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-02-19 14:15:53,653 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:15:53,653 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:53,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1394137879, now seen corresponding path program 6 times [2024-02-19 14:15:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:53,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113976423] [2024-02-19 14:15:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:53,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:53,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:53,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113976423] [2024-02-19 14:15:53,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113976423] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:53,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:53,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:15:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167003266] [2024-02-19 14:15:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:53,950 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:15:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:15:53,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:15:53,964 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:15:53,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 430 transitions, 8498 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-02-19 14:15:53,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:53,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:15:53,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:54,329 INFO L124 PetriNetUnfolderBase]: 484/942 cut-off events. [2024-02-19 14:15:54,329 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-02-19 14:15:54,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10278 conditions, 942 events. 484/942 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4392 event pairs, 8 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 9021. Up to 919 conditions per place. [2024-02-19 14:15:54,343 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 319 selfloop transitions, 117 changer transitions 20/457 dead transitions. [2024-02-19 14:15:54,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 457 transitions, 9976 flow [2024-02-19 14:15:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 14:15:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 14:15:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 226 transitions. [2024-02-19 14:15:54,344 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.28974358974358977 [2024-02-19 14:15:54,345 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-02-19 14:15:54,346 INFO L507 AbstractCegarLoop]: Abstraction has has 117 places, 457 transitions, 9976 flow [2024-02-19 14:15:54,346 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-02-19 14:15:54,346 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:54,346 INFO L234 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-02-19 14:15:54,346 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 14:15:54,346 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:54,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1178096593, now seen corresponding path program 1 times [2024-02-19 14:15:54,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:54,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221731324] [2024-02-19 14:15:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:54,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:55,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:55,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221731324] [2024-02-19 14:15:55,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221731324] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:55,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:55,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-02-19 14:15:55,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868995158] [2024-02-19 14:15:55,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:55,254 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 14:15:55,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:55,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 14:15:55,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-02-19 14:15:55,288 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:15:55,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 457 transitions, 9976 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:15:55,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:55,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:15:55,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:55,945 INFO L124 PetriNetUnfolderBase]: 557/1089 cut-off events. [2024-02-19 14:15:55,945 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2024-02-19 14:15:55,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12977 conditions, 1089 events. 557/1089 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5349 event pairs, 8 based on Foata normal form. 0/1084 useless extension candidates. Maximal degree in co-relation 11256. Up to 1063 conditions per place. [2024-02-19 14:15:55,958 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 367 selfloop transitions, 82 changer transitions 104/554 dead transitions. [2024-02-19 14:15:55,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 554 transitions, 13212 flow [2024-02-19 14:15:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:15:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:15:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 241 transitions. [2024-02-19 14:15:55,961 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2869047619047619 [2024-02-19 14:15:55,961 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 77 predicate places. [2024-02-19 14:15:55,961 INFO L507 AbstractCegarLoop]: Abstraction has has 130 places, 554 transitions, 13212 flow [2024-02-19 14:15:55,962 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:15:55,962 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:55,962 INFO L234 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-02-19 14:15:55,962 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-19 14:15:55,963 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:55,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2069892859, now seen corresponding path program 2 times [2024-02-19 14:15:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010764382] [2024-02-19 14:15:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:56,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010764382] [2024-02-19 14:15:56,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010764382] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:56,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:56,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-02-19 14:15:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115801231] [2024-02-19 14:15:56,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:56,843 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 14:15:56,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:56,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 14:15:56,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-02-19 14:15:56,870 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:15:56,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 554 transitions, 13212 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:15:56,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:56,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:15:56,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:57,634 INFO L124 PetriNetUnfolderBase]: 614/1210 cut-off events. [2024-02-19 14:15:57,634 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2024-02-19 14:15:57,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15631 conditions, 1210 events. 614/1210 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6150 event pairs, 15 based on Foata normal form. 0/1205 useless extension candidates. Maximal degree in co-relation 13441. Up to 1181 conditions per place. [2024-02-19 14:15:57,646 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 368 selfloop transitions, 62 changer transitions 200/631 dead transitions. [2024-02-19 14:15:57,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 631 transitions, 16313 flow [2024-02-19 14:15:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:15:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:15:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 243 transitions. [2024-02-19 14:15:57,648 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2892857142857143 [2024-02-19 14:15:57,648 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 90 predicate places. [2024-02-19 14:15:57,648 INFO L507 AbstractCegarLoop]: Abstraction has has 143 places, 631 transitions, 16313 flow [2024-02-19 14:15:57,649 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:15:57,649 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:57,649 INFO L234 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-02-19 14:15:57,649 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-19 14:15:57,649 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:57,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1353463269, now seen corresponding path program 3 times [2024-02-19 14:15:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552030992] [2024-02-19 14:15:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552030992] [2024-02-19 14:15:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552030992] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:58,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-02-19 14:15:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280809812] [2024-02-19 14:15:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:58,594 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 14:15:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 14:15:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-02-19 14:15:58,615 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:15:58,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 631 transitions, 16313 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:15:58,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:58,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:15:58,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:59,301 INFO L124 PetriNetUnfolderBase]: 614/1208 cut-off events. [2024-02-19 14:15:59,302 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2024-02-19 14:15:59,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16827 conditions, 1208 events. 614/1208 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6140 event pairs, 14 based on Foata normal form. 0/1204 useless extension candidates. Maximal degree in co-relation 14474. Up to 1180 conditions per place. [2024-02-19 14:15:59,310 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 282 selfloop transitions, 46 changer transitions 308/637 dead transitions. [2024-02-19 14:15:59,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 637 transitions, 17722 flow [2024-02-19 14:15:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 14:15:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 14:15:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 232 transitions. [2024-02-19 14:15:59,311 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.29743589743589743 [2024-02-19 14:15:59,312 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 102 predicate places. [2024-02-19 14:15:59,312 INFO L507 AbstractCegarLoop]: Abstraction has has 155 places, 637 transitions, 17722 flow [2024-02-19 14:15:59,313 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:15:59,313 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:59,313 INFO L234 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-02-19 14:15:59,313 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-19 14:15:59,313 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:15:59,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash -512928867, now seen corresponding path program 4 times [2024-02-19 14:15:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103290818] [2024-02-19 14:15:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:00,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:00,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103290818] [2024-02-19 14:16:00,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103290818] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:00,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:00,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-02-19 14:16:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841658892] [2024-02-19 14:16:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:00,065 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 14:16:00,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 14:16:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-02-19 14:16:00,081 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:16:00,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 637 transitions, 17722 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:00,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:00,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:16:00,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:00,795 INFO L124 PetriNetUnfolderBase]: 647/1269 cut-off events. [2024-02-19 14:16:00,795 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-02-19 14:16:00,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18970 conditions, 1269 events. 647/1269 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6594 event pairs, 13 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 16212. Up to 1242 conditions per place. [2024-02-19 14:16:00,807 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 234 selfloop transitions, 45 changer transitions 378/658 dead transitions. [2024-02-19 14:16:00,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 658 transitions, 19611 flow [2024-02-19 14:16:00,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:16:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:16:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 244 transitions. [2024-02-19 14:16:00,809 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2904761904761905 [2024-02-19 14:16:00,809 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 115 predicate places. [2024-02-19 14:16:00,810 INFO L507 AbstractCegarLoop]: Abstraction has has 168 places, 658 transitions, 19611 flow [2024-02-19 14:16:00,810 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:00,810 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:00,810 INFO L234 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-02-19 14:16:00,810 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-19 14:16:00,810 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:00,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 275562007, now seen corresponding path program 5 times [2024-02-19 14:16:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:00,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430089061] [2024-02-19 14:16:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:01,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430089061] [2024-02-19 14:16:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430089061] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:16:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68095419] [2024-02-19 14:16:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:01,112 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:16:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:16:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:16:01,113 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:16:01,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 658 transitions, 19611 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:16:01,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:01,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:16:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:01,639 INFO L124 PetriNetUnfolderBase]: 662/1302 cut-off events. [2024-02-19 14:16:01,639 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2024-02-19 14:16:01,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20746 conditions, 1302 events. 662/1302 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6832 event pairs, 8 based on Foata normal form. 10/1309 useless extension candidates. Maximal degree in co-relation 17820. Up to 1275 conditions per place. [2024-02-19 14:16:01,652 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 215 selfloop transitions, 97 changer transitions 378/697 dead transitions. [2024-02-19 14:16:01,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 697 transitions, 22135 flow [2024-02-19 14:16:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 14:16:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 14:16:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 368 transitions. [2024-02-19 14:16:01,653 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-02-19 14:16:01,654 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 126 predicate places. [2024-02-19 14:16:01,654 INFO L507 AbstractCegarLoop]: Abstraction has has 179 places, 697 transitions, 22135 flow [2024-02-19 14:16:01,654 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:16:01,654 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:01,654 INFO L234 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-02-19 14:16:01,655 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-19 14:16:01,655 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:01,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1731553189, now seen corresponding path program 6 times [2024-02-19 14:16:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617314335] [2024-02-19 14:16:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:02,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:02,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617314335] [2024-02-19 14:16:02,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617314335] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:02,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:02,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-02-19 14:16:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646549098] [2024-02-19 14:16:02,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:02,361 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 14:16:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 14:16:02,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-02-19 14:16:02,377 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:16:02,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 697 transitions, 22135 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:02,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:02,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:16:02,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:03,212 INFO L124 PetriNetUnfolderBase]: 865/1673 cut-off events. [2024-02-19 14:16:03,212 INFO L125 PetriNetUnfolderBase]: For 487/487 co-relation queries the response was YES. [2024-02-19 14:16:03,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28351 conditions, 1673 events. 865/1673 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9358 event pairs, 12 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 24543. Up to 1643 conditions per place. [2024-02-19 14:16:03,228 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 326 selfloop transitions, 73 changer transitions 480/880 dead transitions. [2024-02-19 14:16:03,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 880 transitions, 29741 flow [2024-02-19 14:16:03,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:16:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:16:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 257 transitions. [2024-02-19 14:16:03,230 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.28555555555555556 [2024-02-19 14:16:03,231 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 140 predicate places. [2024-02-19 14:16:03,231 INFO L507 AbstractCegarLoop]: Abstraction has has 193 places, 880 transitions, 29741 flow [2024-02-19 14:16:03,231 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:03,231 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:03,232 INFO L234 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-02-19 14:16:03,232 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-19 14:16:03,232 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:03,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash 397006047, now seen corresponding path program 7 times [2024-02-19 14:16:03,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110016206] [2024-02-19 14:16:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:03,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:04,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110016206] [2024-02-19 14:16:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110016206] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:04,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-02-19 14:16:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099900628] [2024-02-19 14:16:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:04,003 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 14:16:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:04,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 14:16:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-02-19 14:16:04,017 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:16:04,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 880 transitions, 29741 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:16:04,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:04,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:16:04,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:04,934 INFO L124 PetriNetUnfolderBase]: 932/1814 cut-off events. [2024-02-19 14:16:04,934 INFO L125 PetriNetUnfolderBase]: For 550/550 co-relation queries the response was YES. [2024-02-19 14:16:04,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32556 conditions, 1814 events. 932/1814 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10481 event pairs, 4 based on Foata normal form. 0/1811 useless extension candidates. Maximal degree in co-relation 27930. Up to 1781 conditions per place. [2024-02-19 14:16:04,950 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 300 selfloop transitions, 76 changer transitions 580/957 dead transitions. [2024-02-19 14:16:04,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 957 transitions, 34269 flow [2024-02-19 14:16:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:16:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:16:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 245 transitions. [2024-02-19 14:16:04,951 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2024-02-19 14:16:04,952 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 153 predicate places. [2024-02-19 14:16:04,952 INFO L507 AbstractCegarLoop]: Abstraction has has 206 places, 957 transitions, 34269 flow [2024-02-19 14:16:04,952 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:16:04,952 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:04,952 INFO L234 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-02-19 14:16:04,952 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-19 14:16:04,953 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:04,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1177857937, now seen corresponding path program 8 times [2024-02-19 14:16:04,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4209847] [2024-02-19 14:16:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:04,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4209847] [2024-02-19 14:16:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4209847] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:05,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:05,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-02-19 14:16:05,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881409745] [2024-02-19 14:16:05,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:05,661 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 14:16:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:05,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 14:16:05,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-02-19 14:16:05,682 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:16:05,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 957 transitions, 34269 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:05,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:05,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:16:05,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:06,684 INFO L124 PetriNetUnfolderBase]: 1008/1964 cut-off events. [2024-02-19 14:16:06,685 INFO L125 PetriNetUnfolderBase]: For 583/583 co-relation queries the response was YES. [2024-02-19 14:16:06,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37211 conditions, 1964 events. 1008/1964 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11543 event pairs, 12 based on Foata normal form. 0/1961 useless extension candidates. Maximal degree in co-relation 31932. Up to 1928 conditions per place. [2024-02-19 14:16:06,698 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 264 selfloop transitions, 53 changer transitions 713/1031 dead transitions. [2024-02-19 14:16:06,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1031 transitions, 38976 flow [2024-02-19 14:16:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:16:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:16:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 261 transitions. [2024-02-19 14:16:06,709 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.29 [2024-02-19 14:16:06,709 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 167 predicate places. [2024-02-19 14:16:06,710 INFO L507 AbstractCegarLoop]: Abstraction has has 220 places, 1031 transitions, 38976 flow [2024-02-19 14:16:06,710 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:06,710 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:06,710 INFO L234 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-02-19 14:16:06,710 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-19 14:16:06,710 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:06,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash 328121571, now seen corresponding path program 9 times [2024-02-19 14:16:06,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:06,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791408183] [2024-02-19 14:16:06,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:06,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:07,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791408183] [2024-02-19 14:16:07,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791408183] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:16:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077795564] [2024-02-19 14:16:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:07,039 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:16:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:07,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:16:07,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:16:07,041 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:16:07,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 1031 transitions, 38976 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:16:07,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:07,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:16:07,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:07,863 INFO L124 PetriNetUnfolderBase]: 904/1817 cut-off events. [2024-02-19 14:16:07,863 INFO L125 PetriNetUnfolderBase]: For 826/826 co-relation queries the response was YES. [2024-02-19 14:16:07,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36160 conditions, 1817 events. 904/1817 cut-off events. For 826/826 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10694 event pairs, 20 based on Foata normal form. 18/1831 useless extension candidates. Maximal degree in co-relation 30652. Up to 1776 conditions per place. [2024-02-19 14:16:07,876 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 215 selfloop transitions, 66 changer transitions 689/977 dead transitions. [2024-02-19 14:16:07,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 977 transitions, 38832 flow [2024-02-19 14:16:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 14:16:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 14:16:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 372 transitions. [2024-02-19 14:16:07,883 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-02-19 14:16:07,883 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 178 predicate places. [2024-02-19 14:16:07,883 INFO L507 AbstractCegarLoop]: Abstraction has has 231 places, 977 transitions, 38832 flow [2024-02-19 14:16:07,884 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:16:07,884 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:07,884 INFO L234 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-02-19 14:16:07,884 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-19 14:16:07,884 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:07,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1388523107, now seen corresponding path program 10 times [2024-02-19 14:16:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208361845] [2024-02-19 14:16:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:08,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:08,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208361845] [2024-02-19 14:16:08,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208361845] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:08,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:08,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-02-19 14:16:08,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88531872] [2024-02-19 14:16:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:08,514 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 14:16:08,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 14:16:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-02-19 14:16:08,535 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:16:08,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 977 transitions, 38832 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:08,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:08,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:16:08,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:09,500 INFO L124 PetriNetUnfolderBase]: 904/1815 cut-off events. [2024-02-19 14:16:09,500 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2024-02-19 14:16:09,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37959 conditions, 1815 events. 904/1815 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10681 event pairs, 2 based on Foata normal form. 0/1812 useless extension candidates. Maximal degree in co-relation 32184. Up to 1775 conditions per place. [2024-02-19 14:16:09,517 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 169 selfloop transitions, 42 changer transitions 770/982 dead transitions. [2024-02-19 14:16:09,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 982 transitions, 41006 flow [2024-02-19 14:16:09,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:16:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:16:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 254 transitions. [2024-02-19 14:16:09,518 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2822222222222222 [2024-02-19 14:16:09,519 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 192 predicate places. [2024-02-19 14:16:09,519 INFO L507 AbstractCegarLoop]: Abstraction has has 245 places, 982 transitions, 41006 flow [2024-02-19 14:16:09,519 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:09,519 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:09,519 INFO L234 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-02-19 14:16:09,519 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-19 14:16:09,520 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:09,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:09,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1806410783, now seen corresponding path program 11 times [2024-02-19 14:16:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:09,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793622286] [2024-02-19 14:16:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:10,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793622286] [2024-02-19 14:16:10,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793622286] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:10,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:10,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-02-19 14:16:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128261988] [2024-02-19 14:16:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:10,176 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 14:16:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:10,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 14:16:10,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-02-19 14:16:10,187 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:16:10,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 982 transitions, 41006 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:16:10,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:10,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:16:10,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:11,275 INFO L124 PetriNetUnfolderBase]: 904/1813 cut-off events. [2024-02-19 14:16:11,275 INFO L125 PetriNetUnfolderBase]: For 857/857 co-relation queries the response was YES. [2024-02-19 14:16:11,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39756 conditions, 1813 events. 904/1813 cut-off events. For 857/857 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10687 event pairs, 10 based on Foata normal form. 0/1811 useless extension candidates. Maximal degree in co-relation 33716. Up to 1774 conditions per place. [2024-02-19 14:16:11,292 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 101 selfloop transitions, 30 changer transitions 852/984 dead transitions. [2024-02-19 14:16:11,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 984 transitions, 43026 flow [2024-02-19 14:16:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:16:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:16:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 234 transitions. [2024-02-19 14:16:11,294 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2785714285714286 [2024-02-19 14:16:11,294 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 205 predicate places. [2024-02-19 14:16:11,294 INFO L507 AbstractCegarLoop]: Abstraction has has 258 places, 984 transitions, 43026 flow [2024-02-19 14:16:11,295 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-19 14:16:11,295 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:11,295 INFO L234 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-02-19 14:16:11,295 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-19 14:16:11,296 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:11,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:11,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2084159765, now seen corresponding path program 12 times [2024-02-19 14:16:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040585433] [2024-02-19 14:16:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:11,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040585433] [2024-02-19 14:16:11,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040585433] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:11,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:11,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:16:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220460534] [2024-02-19 14:16:11,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:11,555 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:16:11,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:11,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:16:11,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:16:11,556 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:16:11,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 984 transitions, 43026 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:16:11,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:11,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:16:11,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:12,370 INFO L124 PetriNetUnfolderBase]: 776/1603 cut-off events. [2024-02-19 14:16:12,370 INFO L125 PetriNetUnfolderBase]: For 1043/1043 co-relation queries the response was YES. [2024-02-19 14:16:12,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36707 conditions, 1603 events. 776/1603 cut-off events. For 1043/1043 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9346 event pairs, 0 based on Foata normal form. 18/1619 useless extension candidates. Maximal degree in co-relation 30786. Up to 1564 conditions per place. [2024-02-19 14:16:12,384 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 49 selfloop transitions, 30 changer transitions 820/904 dead transitions. [2024-02-19 14:16:12,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 904 transitions, 41260 flow [2024-02-19 14:16:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 14:16:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 14:16:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 386 transitions. [2024-02-19 14:16:12,385 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2024-02-19 14:16:12,385 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 216 predicate places. [2024-02-19 14:16:12,386 INFO L507 AbstractCegarLoop]: Abstraction has has 269 places, 904 transitions, 41260 flow [2024-02-19 14:16:12,386 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:16:12,386 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:12,386 INFO L234 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-02-19 14:16:12,386 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-19 14:16:12,386 INFO L432 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:12,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1423580185, now seen corresponding path program 13 times [2024-02-19 14:16:12,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:12,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191932524] [2024-02-19 14:16:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:12,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:12,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191932524] [2024-02-19 14:16:12,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191932524] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:12,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:12,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-02-19 14:16:13,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762129028] [2024-02-19 14:16:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:13,000 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 14:16:13,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 14:16:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-02-19 14:16:13,032 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-02-19 14:16:13,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 904 transitions, 41260 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:13,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:13,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-02-19 14:16:13,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:13,977 INFO L124 PetriNetUnfolderBase]: 776/1601 cut-off events. [2024-02-19 14:16:13,978 INFO L125 PetriNetUnfolderBase]: For 1082/1082 co-relation queries the response was YES. [2024-02-19 14:16:13,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38292 conditions, 1601 events. 776/1601 cut-off events. For 1082/1082 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9336 event pairs, 0 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 32124. Up to 1563 conditions per place. [2024-02-19 14:16:13,992 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 0 selfloop transitions, 0 changer transitions 902/902 dead transitions. [2024-02-19 14:16:13,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 902 transitions, 43030 flow [2024-02-19 14:16:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:16:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:16:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2024-02-19 14:16:13,994 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2024-02-19 14:16:13,995 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 228 predicate places. [2024-02-19 14:16:13,995 INFO L507 AbstractCegarLoop]: Abstraction has has 281 places, 902 transitions, 43030 flow [2024-02-19 14:16:13,995 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-02-19 14:16:13,997 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-02-19 14:16:13,997 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-02-19 14:16:13,998 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-02-19 14:16:13,998 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-02-19 14:16:13,998 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-02-19 14:16:13,998 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-02-19 14:16:13,998 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-02-19 14:16:13,998 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-02-19 14:16:13,998 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-19 14:16:14,753 INFO L644 CegarLoopForPetriNet]: Computed Owicki-Gries annotation of size 27776 in 753781771ns [2024-02-19 14:16:14,755 INFO L457 BasicCegarLoop]: Path program histogram: [13, 6, 1, 1, 1, 1] [2024-02-19 14:16:14,758 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-19 14:16:14,770 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Multiple instances of thread not yet supported: 39#L1713-3true at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.OwickiGriesUnpetrifier.computeFormulaMapping(OwickiGriesUnpetrifier.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.OwickiGriesUnpetrifier.(OwickiGriesUnpetrifier.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-02-19 14:16:14,775 INFO L158 Benchmark]: Toolchain (without parser) took 28273.83ms. Allocated memory was 69.2MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 45.9MB in the beginning and 1.0GB in the end (delta: -971.9MB). Peak memory consumption was 673.7MB. Max. memory is 16.1GB. [2024-02-19 14:16:14,775 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 31.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 14:16:14,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 815.47ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.7MB in the beginning and 48.3MB in the end (delta: -2.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-02-19 14:16:14,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.99ms. Allocated memory is still 83.9MB. Free memory was 48.3MB in the beginning and 44.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-19 14:16:14,776 INFO L158 Benchmark]: Boogie Preprocessor took 46.54ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 40.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-19 14:16:14,776 INFO L158 Benchmark]: RCFGBuilder took 688.23ms. Allocated memory is still 83.9MB. Free memory was 40.3MB in the beginning and 40.9MB in the end (delta: -651.2kB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-02-19 14:16:14,776 INFO L158 Benchmark]: TraceAbstraction took 26655.87ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 40.4MB in the beginning and 1.0GB in the end (delta: -977.4MB). Peak memory consumption was 653.6MB. Max. memory is 16.1GB. [2024-02-19 14:16:14,777 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.17ms. Allocated memory is still 52.4MB. Free memory is still 31.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 815.47ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.7MB in the beginning and 48.3MB in the end (delta: -2.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.99ms. Allocated memory is still 83.9MB. Free memory was 48.3MB in the beginning and 44.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.54ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 40.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 688.23ms. Allocated memory is still 83.9MB. Free memory was 40.3MB in the beginning and 40.9MB in the end (delta: -651.2kB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26655.87ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 40.4MB in the beginning and 1.0GB in the end (delta: -977.4MB). Peak memory consumption was 653.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Multiple instances of thread not yet supported: 39#L1713-3true de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Multiple instances of thread not yet supported: 39#L1713-3true: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.OwickiGriesUnpetrifier.computeFormulaMapping(OwickiGriesUnpetrifier.java:163) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-02-19 14:16:14,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-2_1-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fddded73cca9ade55587111b2e2c843e75dd81397929514bda88fadfc663c7db --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:16:16,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:16:16,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 14:16:16,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:16:16,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:16:17,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:16:17,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:16:17,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:16:17,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:16:17,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:16:17,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:16:17,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:16:17,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:16:17,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:16:17,021 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:16:17,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:16:17,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:16:17,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:16:17,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:16:17,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:16:17,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:16:17,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:16:17,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:16:17,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 14:16:17,024 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 14:16:17,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:16:17,024 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 14:16:17,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:16:17,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:16:17,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:16:17,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:16:17,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:16:17,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:16:17,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:16:17,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:16:17,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:16:17,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:16:17,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:16:17,028 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 14:16:17,028 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 14:16:17,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:16:17,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:16:17,028 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:16:17,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:16:17,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:16:17,029 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 14:16:17,029 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 -> fddded73cca9ade55587111b2e2c843e75dd81397929514bda88fadfc663c7db Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:16:17,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:16:17,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:16:17,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:16:17,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:16:17,270 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:16:17,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2024-02-19 14:16:18,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:16:18,758 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:16:18,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2024-02-19 14:16:18,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7111e4cf1/088db568d6cd484582e0a17b15b15a85/FLAG955a802af [2024-02-19 14:16:18,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7111e4cf1/088db568d6cd484582e0a17b15b15a85 [2024-02-19 14:16:18,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:16:18,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:16:18,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:16:18,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:16:18,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:16:18,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:16:18" (1/1) ... [2024-02-19 14:16:18,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28915ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:18, skipping insertion in model container [2024-02-19 14:16:18,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:16:18" (1/1) ... [2024-02-19 14:16:18,868 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:16:19,434 WARN L239 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-2_1-container_of.i[76077,76090] [2024-02-19 14:16:19,471 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:16:19,482 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 14:16:19,499 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:16:19,535 WARN L239 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-2_1-container_of.i[76077,76090] [2024-02-19 14:16:19,552 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:16:19,557 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:16:19,593 WARN L239 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-2_1-container_of.i[76077,76090] [2024-02-19 14:16:19,610 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:16:19,744 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:16:19,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19 WrapperNode [2024-02-19 14:16:19,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:16:19,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:16:19,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:16:19,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:16:19,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,811 INFO L138 Inliner]: procedures = 487, calls = 47, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 132 [2024-02-19 14:16:19,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:16:19,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:16:19,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:16:19,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:16:19,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,845 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 3, 3, 2, 13]. 57 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1, 0, 0]. The 10 writes are split as follows [0, 1, 1, 2, 6]. [2024-02-19 14:16:19,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:16:19,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:16:19,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:16:19,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:16:19,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (1/1) ... [2024-02-19 14:16:19,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:16:19,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:16:19,926 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-02-19 14:16:19,968 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-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-02-19 14:16:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:16:19,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-02-19 14:16:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-02-19 14:16:19,992 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-02-19 14:16:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:16:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 14:16:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 14:16:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 14:16:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 14:16:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-02-19 14:16:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-19 14:16:19,994 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:16:20,265 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:16:20,267 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:16:20,532 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:16:20,532 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:16:20,685 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:16:20,686 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-19 14:16:20,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:16:20 BoogieIcfgContainer [2024-02-19 14:16:20,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:16:20,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:16:20,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:16:20,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:16:20,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:16:18" (1/3) ... [2024-02-19 14:16:20,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af5d5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:16:20, skipping insertion in model container [2024-02-19 14:16:20,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:16:19" (2/3) ... [2024-02-19 14:16:20,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af5d5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:16:20, skipping insertion in model container [2024-02-19 14:16:20,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:16:20" (3/3) ... [2024-02-19 14:16:20,693 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2024-02-19 14:16:20,707 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:16:20,708 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-02-19 14:16:20,708 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:16:20,749 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 14:16:20,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2024-02-19 14:16:20,812 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2024-02-19 14:16:20,812 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:16:20,815 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 7. Compared 145 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-02-19 14:16:20,816 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2024-02-19 14:16:20,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2024-02-19 14:16:20,825 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:16:20,830 INFO L369 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=All, 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;@4d6fa61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:16:20,830 INFO L370 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-02-19 14:16:20,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:16:20,833 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2024-02-19 14:16:20,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:16:20,834 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:20,834 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-19 14:16:20,835 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:20,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash 13469612, now seen corresponding path program 1 times [2024-02-19 14:16:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914068828] [2024-02-19 14:16:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:20,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:20,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:20,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-02-19 14:16:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:21,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 14:16:21,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:21,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:21,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914068828] [2024-02-19 14:16:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914068828] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:21,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:16:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065992560] [2024-02-19 14:16:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:21,139 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:16:21,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:21,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:16:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:16:21,174 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:16:21,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-02-19 14:16:21,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:21,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:16:21,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:21,803 INFO L124 PetriNetUnfolderBase]: 406/763 cut-off events. [2024-02-19 14:16:21,803 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-19 14:16:21,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 763 events. 406/763 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3284 event pairs, 345 based on Foata normal form. 41/803 useless extension candidates. Maximal degree in co-relation 1382. Up to 602 conditions per place. [2024-02-19 14:16:21,810 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 40 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-02-19 14:16:21,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 208 flow [2024-02-19 14:16:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:16:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:16:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-02-19 14:16:21,819 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2024-02-19 14:16:21,822 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-02-19 14:16:21,822 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 208 flow [2024-02-19 14:16:21,823 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-02-19 14:16:21,823 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:21,823 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:16:21,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-02-19 14:16:22,034 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:22,034 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:22,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 59426671, now seen corresponding path program 1 times [2024-02-19 14:16:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:22,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436165076] [2024-02-19 14:16:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:22,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:22,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-02-19 14:16:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:22,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 14:16:22,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:22,215 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:22,216 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:22,216 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:22,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 71 [2024-02-19 14:16:22,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:16:22,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 147 treesize of output 57 [2024-02-19 14:16:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:22,378 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:22,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:22,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436165076] [2024-02-19 14:16:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436165076] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:22,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:16:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455903518] [2024-02-19 14:16:22,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:22,380 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:16:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:16:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:16:22,421 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:16:22,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-02-19 14:16:22,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:22,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:16:22,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:25,220 INFO L124 PetriNetUnfolderBase]: 406/761 cut-off events. [2024-02-19 14:16:25,220 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-02-19 14:16:25,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 761 events. 406/761 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3342 event pairs, 155 based on Foata normal form. 1/761 useless extension candidates. Maximal degree in co-relation 2040. Up to 601 conditions per place. [2024-02-19 14:16:25,227 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 46 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2024-02-19 14:16:25,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 351 flow [2024-02-19 14:16:25,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:16:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:16:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-02-19 14:16:25,233 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2024-02-19 14:16:25,234 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-02-19 14:16:25,234 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 351 flow [2024-02-19 14:16:25,234 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-02-19 14:16:25,234 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:25,234 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:16:25,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-02-19 14:16:25,455 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:25,455 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:25,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash 118375970, now seen corresponding path program 1 times [2024-02-19 14:16:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:25,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488054951] [2024-02-19 14:16:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:25,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:25,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-02-19 14:16:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:25,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 14:16:25,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:25,723 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:25,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:25,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:25,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 41 [2024-02-19 14:16:25,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:16:25,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 49 [2024-02-19 14:16:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:25,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:25,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:25,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488054951] [2024-02-19 14:16:25,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488054951] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:25,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:25,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:16:25,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579818095] [2024-02-19 14:16:25,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:25,808 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:16:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:25,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:16:25,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:16:25,831 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:16:25,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-02-19 14:16:25,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:25,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:16:25,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:26,715 INFO L124 PetriNetUnfolderBase]: 460/903 cut-off events. [2024-02-19 14:16:26,715 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-02-19 14:16:26,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3399 conditions, 903 events. 460/903 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4511 event pairs, 119 based on Foata normal form. 64/966 useless extension candidates. Maximal degree in co-relation 3220. Up to 684 conditions per place. [2024-02-19 14:16:26,719 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 55 selfloop transitions, 6 changer transitions 24/93 dead transitions. [2024-02-19 14:16:26,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 93 transitions, 705 flow [2024-02-19 14:16:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:16:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:16:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-02-19 14:16:26,724 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-19 14:16:26,725 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-02-19 14:16:26,725 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 93 transitions, 705 flow [2024-02-19 14:16:26,725 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-02-19 14:16:26,725 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:26,725 INFO L234 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-02-19 14:16:26,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-02-19 14:16:26,931 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:26,933 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:26,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1322984653, now seen corresponding path program 1 times [2024-02-19 14:16:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011438566] [2024-02-19 14:16:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:26,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:26,936 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:26,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-02-19 14:16:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:27,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 14:16:27,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:27,196 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:27,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:27,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011438566] [2024-02-19 14:16:27,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011438566] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:27,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:27,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:16:27,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54066156] [2024-02-19 14:16:27,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:27,197 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:16:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:27,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:16:27,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:16:27,200 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-02-19 14:16:27,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 93 transitions, 705 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-02-19 14:16:27,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:27,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-02-19 14:16:27,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:28,372 INFO L124 PetriNetUnfolderBase]: 225/420 cut-off events. [2024-02-19 14:16:28,372 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-02-19 14:16:28,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 420 events. 225/420 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1432 event pairs, 28 based on Foata normal form. 36/455 useless extension candidates. Maximal degree in co-relation 1862. Up to 409 conditions per place. [2024-02-19 14:16:28,389 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 58 selfloop transitions, 4 changer transitions 11/80 dead transitions. [2024-02-19 14:16:28,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 749 flow [2024-02-19 14:16:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:16:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:16:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-02-19 14:16:28,391 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5366666666666666 [2024-02-19 14:16:28,392 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-02-19 14:16:28,392 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 80 transitions, 749 flow [2024-02-19 14:16:28,392 INFO L508 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-02-19 14:16:28,392 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:28,392 INFO L234 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-02-19 14:16:28,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-02-19 14:16:28,600 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:28,600 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:28,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1504247773, now seen corresponding path program 1 times [2024-02-19 14:16:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:28,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657563631] [2024-02-19 14:16:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:28,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:28,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:28,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:28,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-02-19 14:16:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:28,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-19 14:16:28,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:29,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-02-19 14:16:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:29,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:29,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657563631] [2024-02-19 14:16:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657563631] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:16:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018402080] [2024-02-19 14:16:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:29,057 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:16:29,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:29,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:16:29,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:16:29,061 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:16:29,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 80 transitions, 749 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-02-19 14:16:29,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:29,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:16:29,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:31,148 INFO L124 PetriNetUnfolderBase]: 257/476 cut-off events. [2024-02-19 14:16:31,149 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-02-19 14:16:31,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 476 events. 257/476 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1724 event pairs, 18 based on Foata normal form. 8/483 useless extension candidates. Maximal degree in co-relation 2568. Up to 465 conditions per place. [2024-02-19 14:16:31,152 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 96 selfloop transitions, 37 changer transitions 11/151 dead transitions. [2024-02-19 14:16:31,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 151 transitions, 1750 flow [2024-02-19 14:16:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-19 14:16:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-19 14:16:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 299 transitions. [2024-02-19 14:16:31,153 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49833333333333335 [2024-02-19 14:16:31,155 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-02-19 14:16:31,155 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 151 transitions, 1750 flow [2024-02-19 14:16:31,156 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-02-19 14:16:31,156 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:31,156 INFO L234 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-02-19 14:16:31,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-02-19 14:16:31,364 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:31,365 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:31,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash -660864725, now seen corresponding path program 2 times [2024-02-19 14:16:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832243289] [2024-02-19 14:16:31,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:16:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:31,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:31,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:31,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-02-19 14:16:31,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:16:31,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:16:31,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-19 14:16:31,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:31,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-02-19 14:16:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:31,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:31,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:31,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832243289] [2024-02-19 14:16:31,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832243289] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:31,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:31,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:16:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098610529] [2024-02-19 14:16:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:31,806 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:16:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:31,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:16:31,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:16:31,808 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:16:31,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 151 transitions, 1750 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-02-19 14:16:31,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:31,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:16:31,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:34,160 INFO L124 PetriNetUnfolderBase]: 287/534 cut-off events. [2024-02-19 14:16:34,160 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-02-19 14:16:34,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3711 conditions, 534 events. 287/534 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2031 event pairs, 2 based on Foata normal form. 8/541 useless extension candidates. Maximal degree in co-relation 3344. Up to 523 conditions per place. [2024-02-19 14:16:34,167 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 144 selfloop transitions, 75 changer transitions 11/237 dead transitions. [2024-02-19 14:16:34,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 237 transitions, 3242 flow [2024-02-19 14:16:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 14:16:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 14:16:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 356 transitions. [2024-02-19 14:16:34,169 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-02-19 14:16:34,172 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-02-19 14:16:34,172 INFO L507 AbstractCegarLoop]: Abstraction has has 78 places, 237 transitions, 3242 flow [2024-02-19 14:16:34,172 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-02-19 14:16:34,172 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:34,172 INFO L234 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-02-19 14:16:34,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-02-19 14:16:34,380 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:34,380 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:34,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash -376795133, now seen corresponding path program 3 times [2024-02-19 14:16:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:34,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980441686] [2024-02-19 14:16:34,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:16:34,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:34,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:34,383 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:34,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-02-19 14:16:34,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-19 14:16:34,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:16:34,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2024-02-19 14:16:34,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:34,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:34,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:34,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:34,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:34,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:34,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 29 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33 [2024-02-19 14:16:35,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:16:35,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 45 [2024-02-19 14:16:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:35,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:35,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:35,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980441686] [2024-02-19 14:16:35,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980441686] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:35,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:35,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:16:35,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364106924] [2024-02-19 14:16:35,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:35,058 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:16:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:35,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:16:35,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:16:35,101 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:16:35,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 237 transitions, 3242 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-02-19 14:16:35,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:35,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:16:35,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:38,154 INFO L124 PetriNetUnfolderBase]: 331/628 cut-off events. [2024-02-19 14:16:38,154 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2024-02-19 14:16:38,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4969 conditions, 628 events. 331/628 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2510 event pairs, 15 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 4420. Up to 613 conditions per place. [2024-02-19 14:16:38,160 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 192 selfloop transitions, 77 changer transitions 13/287 dead transitions. [2024-02-19 14:16:38,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 287 transitions, 4503 flow [2024-02-19 14:16:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 14:16:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 14:16:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 300 transitions. [2024-02-19 14:16:38,173 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2024-02-19 14:16:38,174 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2024-02-19 14:16:38,174 INFO L507 AbstractCegarLoop]: Abstraction has has 90 places, 287 transitions, 4503 flow [2024-02-19 14:16:38,176 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-02-19 14:16:38,176 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:38,176 INFO L234 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-02-19 14:16:38,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-02-19 14:16:38,384 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:38,385 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:38,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash -475862421, now seen corresponding path program 4 times [2024-02-19 14:16:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119099810] [2024-02-19 14:16:38,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 14:16:38,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:38,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:38,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:38,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-02-19 14:16:38,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 14:16:38,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:16:38,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-19 14:16:38,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:38,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-02-19 14:16:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:38,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:38,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119099810] [2024-02-19 14:16:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119099810] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:38,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:38,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:16:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233679393] [2024-02-19 14:16:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:38,830 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:16:38,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:16:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:16:38,831 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:16:38,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 287 transitions, 4503 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-02-19 14:16:38,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:38,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:16:38,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:41,306 INFO L124 PetriNetUnfolderBase]: 593/1129 cut-off events. [2024-02-19 14:16:41,307 INFO L125 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2024-02-19 14:16:41,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10029 conditions, 1129 events. 593/1129 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5525 event pairs, 24 based on Foata normal form. 16/1144 useless extension candidates. Maximal degree in co-relation 8922. Up to 1104 conditions per place. [2024-02-19 14:16:41,317 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 338 selfloop transitions, 108 changer transitions 18/472 dead transitions. [2024-02-19 14:16:41,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 472 transitions, 8406 flow [2024-02-19 14:16:41,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 14:16:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 14:16:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 355 transitions. [2024-02-19 14:16:41,319 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-02-19 14:16:41,319 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 47 predicate places. [2024-02-19 14:16:41,319 INFO L507 AbstractCegarLoop]: Abstraction has has 100 places, 472 transitions, 8406 flow [2024-02-19 14:16:41,320 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-02-19 14:16:41,320 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:41,320 INFO L234 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-02-19 14:16:41,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-02-19 14:16:41,526 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:41,526 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:41,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash -42831813, now seen corresponding path program 5 times [2024-02-19 14:16:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500074152] [2024-02-19 14:16:41,527 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 14:16:41,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:41,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:41,530 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:41,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-02-19 14:16:41,880 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:16:41,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:16:41,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 21 conjunts are in the unsatisfiable core [2024-02-19 14:16:41,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:42,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:42,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:42,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:42,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:42,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:42,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:16:42,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 81 [2024-02-19 14:16:42,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:16:42,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 141 treesize of output 81 [2024-02-19 14:16:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:42,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:42,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500074152] [2024-02-19 14:16:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500074152] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:42,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:42,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:16:42,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393226855] [2024-02-19 14:16:42,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:42,327 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:16:42,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:42,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:16:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:16:42,438 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:16:42,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 472 transitions, 8406 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-02-19 14:16:42,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:42,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:16:42,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:46,171 INFO L124 PetriNetUnfolderBase]: 593/1125 cut-off events. [2024-02-19 14:16:46,171 INFO L125 PetriNetUnfolderBase]: For 533/533 co-relation queries the response was YES. [2024-02-19 14:16:46,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11125 conditions, 1125 events. 593/1125 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5399 event pairs, 14 based on Foata normal form. 2/1126 useless extension candidates. Maximal degree in co-relation 9912. Up to 1102 conditions per place. [2024-02-19 14:16:46,181 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 345 selfloop transitions, 129 changer transitions 18/496 dead transitions. [2024-02-19 14:16:46,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 496 transitions, 9840 flow [2024-02-19 14:16:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 14:16:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 14:16:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 296 transitions. [2024-02-19 14:16:46,184 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37948717948717947 [2024-02-19 14:16:46,184 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2024-02-19 14:16:46,184 INFO L507 AbstractCegarLoop]: Abstraction has has 110 places, 496 transitions, 9840 flow [2024-02-19 14:16:46,184 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-02-19 14:16:46,185 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:46,185 INFO L234 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-02-19 14:16:46,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-02-19 14:16:46,394 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:46,395 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:16:46,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash 159581345, now seen corresponding path program 1 times [2024-02-19 14:16:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:16:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849807948] [2024-02-19 14:16:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:16:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:16:46,397 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:16:46,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-02-19 14:16:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:46,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:16:46,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:16:46,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:46,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:46,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:46,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:16:47,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:47,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:47,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:16:47,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:47,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:16:47,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 129 [2024-02-19 14:16:47,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:16:47,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 261 treesize of output 145 [2024-02-19 14:16:47,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:16:47,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 285 [2024-02-19 14:16:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:47,858 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:16:47,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:16:47,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849807948] [2024-02-19 14:16:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849807948] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:47,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:47,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:16:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837894684] [2024-02-19 14:16:47,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:47,859 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:16:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:16:47,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:16:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:16:48,042 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:16:48,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 496 transitions, 9840 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:16:48,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:48,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:16:48,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:17:03,098 INFO L124 PetriNetUnfolderBase]: 666/1272 cut-off events. [2024-02-19 14:17:03,098 INFO L125 PetriNetUnfolderBase]: For 771/771 co-relation queries the response was YES. [2024-02-19 14:17:03,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13837 conditions, 1272 events. 666/1272 cut-off events. For 771/771 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6431 event pairs, 17 based on Foata normal form. 1/1272 useless extension candidates. Maximal degree in co-relation 12200. Up to 1246 conditions per place. [2024-02-19 14:17:03,109 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 405 selfloop transitions, 86 changer transitions 100/595 dead transitions. [2024-02-19 14:17:03,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 595 transitions, 13014 flow [2024-02-19 14:17:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:17:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:17:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 318 transitions. [2024-02-19 14:17:03,115 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2024-02-19 14:17:03,115 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 70 predicate places. [2024-02-19 14:17:03,116 INFO L507 AbstractCegarLoop]: Abstraction has has 123 places, 595 transitions, 13014 flow [2024-02-19 14:17:03,116 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:17:03,116 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:17:03,116 INFO L234 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-02-19 14:17:03,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-02-19 14:17:03,325 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:03,325 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:17:03,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:17:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1649023745, now seen corresponding path program 2 times [2024-02-19 14:17:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:17:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344834512] [2024-02-19 14:17:03,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:17:03,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:03,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:17:03,328 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:17:03,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-02-19 14:17:03,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:17:03,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:17:03,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:17:03,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:17:03,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:03,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:03,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:03,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:17:04,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:04,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:04,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:04,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:04,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:04,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 129 [2024-02-19 14:17:04,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:17:04,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 261 treesize of output 145 [2024-02-19 14:17:04,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:17:04,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 285 [2024-02-19 14:17:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:17:04,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:17:04,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:17:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344834512] [2024-02-19 14:17:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344834512] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:17:04,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:17:04,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:17:04,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170022565] [2024-02-19 14:17:04,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:17:04,846 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:17:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:17:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:17:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:17:04,949 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:17:04,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 595 transitions, 13014 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:17:04,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:17:04,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:17:04,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:17:16,261 INFO L124 PetriNetUnfolderBase]: 775/1481 cut-off events. [2024-02-19 14:17:16,262 INFO L125 PetriNetUnfolderBase]: For 1060/1060 co-relation queries the response was YES. [2024-02-19 14:17:16,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17584 conditions, 1481 events. 775/1481 cut-off events. For 1060/1060 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7871 event pairs, 9 based on Foata normal form. 1/1481 useless extension candidates. Maximal degree in co-relation 15420. Up to 1452 conditions per place. [2024-02-19 14:17:16,272 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 411 selfloop transitions, 68 changer transitions 215/698 dead transitions. [2024-02-19 14:17:16,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 698 transitions, 16677 flow [2024-02-19 14:17:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:17:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:17:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 321 transitions. [2024-02-19 14:17:16,294 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2024-02-19 14:17:16,294 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 83 predicate places. [2024-02-19 14:17:16,294 INFO L507 AbstractCegarLoop]: Abstraction has has 136 places, 698 transitions, 16677 flow [2024-02-19 14:17:16,294 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:17:16,294 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:17:16,295 INFO L234 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-02-19 14:17:16,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-02-19 14:17:16,495 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:16,495 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:17:16,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:17:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1999023615, now seen corresponding path program 3 times [2024-02-19 14:17:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:17:16,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145866058] [2024-02-19 14:17:16,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:17:16,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:16,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:17:16,498 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:17:16,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-02-19 14:17:16,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-19 14:17:16,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:17:16,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:17:16,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:17:16,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:16,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:16,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:16,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:17:17,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:17,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:17,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:17,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:17,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:17,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 129 [2024-02-19 14:17:17,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:17:17,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 261 treesize of output 145 [2024-02-19 14:17:17,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:17:17,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 285 [2024-02-19 14:17:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:17:17,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:17:17,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:17:17,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145866058] [2024-02-19 14:17:17,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145866058] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:17:17,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:17:17,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:17:17,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209896545] [2024-02-19 14:17:17,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:17:17,975 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:17:17,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:17:17,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:17:17,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:17:18,072 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:17:18,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 698 transitions, 16677 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:17:18,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:17:18,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:17:18,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:17:28,289 INFO L124 PetriNetUnfolderBase]: 775/1479 cut-off events. [2024-02-19 14:17:28,289 INFO L125 PetriNetUnfolderBase]: For 1259/1259 co-relation queries the response was YES. [2024-02-19 14:17:28,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19034 conditions, 1479 events. 775/1479 cut-off events. For 1259/1259 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7888 event pairs, 12 based on Foata normal form. 1/1479 useless extension candidates. Maximal degree in co-relation 16704. Up to 1451 conditions per place. [2024-02-19 14:17:28,329 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 318 selfloop transitions, 46 changer transitions 337/705 dead transitions. [2024-02-19 14:17:28,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 705 transitions, 18244 flow [2024-02-19 14:17:28,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 14:17:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 14:17:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2024-02-19 14:17:28,335 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38974358974358975 [2024-02-19 14:17:28,336 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 95 predicate places. [2024-02-19 14:17:28,336 INFO L507 AbstractCegarLoop]: Abstraction has has 148 places, 705 transitions, 18244 flow [2024-02-19 14:17:28,336 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:17:28,336 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:17:28,336 INFO L234 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-02-19 14:17:28,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-02-19 14:17:28,536 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:28,536 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:17:28,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:17:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1654688625, now seen corresponding path program 4 times [2024-02-19 14:17:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:17:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950108380] [2024-02-19 14:17:28,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 14:17:28,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:28,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:17:28,619 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:17:28,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-02-19 14:17:28,925 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 14:17:28,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:17:28,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-19 14:17:28,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:17:29,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-02-19 14:17:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:17:29,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:17:29,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:17:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950108380] [2024-02-19 14:17:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950108380] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:17:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:17:29,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:17:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935894734] [2024-02-19 14:17:29,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:17:29,037 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:17:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:17:29,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:17:29,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:17:29,038 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:17:29,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 705 transitions, 18244 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:17:29,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:17:29,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:17:29,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:17:31,475 INFO L124 PetriNetUnfolderBase]: 614/1208 cut-off events. [2024-02-19 14:17:31,475 INFO L125 PetriNetUnfolderBase]: For 1465/1465 co-relation queries the response was YES. [2024-02-19 14:17:31,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16691 conditions, 1208 events. 614/1208 cut-off events. For 1465/1465 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6159 event pairs, 9 based on Foata normal form. 12/1219 useless extension candidates. Maximal degree in co-relation 14474. Up to 1180 conditions per place. [2024-02-19 14:17:31,511 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 268 selfloop transitions, 54 changer transitions 300/628 dead transitions. [2024-02-19 14:17:31,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 628 transitions, 17480 flow [2024-02-19 14:17:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 14:17:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 14:17:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 341 transitions. [2024-02-19 14:17:31,513 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-02-19 14:17:31,513 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 105 predicate places. [2024-02-19 14:17:31,513 INFO L507 AbstractCegarLoop]: Abstraction has has 158 places, 628 transitions, 17480 flow [2024-02-19 14:17:31,513 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:17:31,513 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:17:31,513 INFO L234 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-02-19 14:17:31,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-02-19 14:17:31,721 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:31,722 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:17:31,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:17:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2074323611, now seen corresponding path program 5 times [2024-02-19 14:17:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:17:31,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162799700] [2024-02-19 14:17:31,723 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 14:17:31,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:17:31,724 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:17:31,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-02-19 14:17:32,112 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:17:32,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:17:32,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:17:32,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:17:32,162 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:32,162 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:32,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:32,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:17:32,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 97 [2024-02-19 14:17:32,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:32,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:32,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:32,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:32,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:32,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:17:32,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 161 [2024-02-19 14:17:33,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:17:33,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-02-19 14:17:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:17:33,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:17:33,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:17:33,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162799700] [2024-02-19 14:17:33,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162799700] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:17:33,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:17:33,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:17:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456115683] [2024-02-19 14:17:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:17:33,221 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:17:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:17:33,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:17:33,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:17:33,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:17:33,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 628 transitions, 17480 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:17:33,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:17:33,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:17:33,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:17:46,357 INFO L124 PetriNetUnfolderBase]: 647/1269 cut-off events. [2024-02-19 14:17:46,358 INFO L125 PetriNetUnfolderBase]: For 1696/1696 co-relation queries the response was YES. [2024-02-19 14:17:46,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18817 conditions, 1269 events. 647/1269 cut-off events. For 1696/1696 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6589 event pairs, 15 based on Foata normal form. 1/1269 useless extension candidates. Maximal degree in co-relation 16212. Up to 1242 conditions per place. [2024-02-19 14:17:46,368 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 234 selfloop transitions, 41 changer transitions 368/647 dead transitions. [2024-02-19 14:17:46,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 647 transitions, 19301 flow [2024-02-19 14:17:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:17:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:17:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 321 transitions. [2024-02-19 14:17:46,375 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2024-02-19 14:17:46,375 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 118 predicate places. [2024-02-19 14:17:46,375 INFO L507 AbstractCegarLoop]: Abstraction has has 171 places, 647 transitions, 19301 flow [2024-02-19 14:17:46,376 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:17:46,376 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:17:46,376 INFO L234 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-02-19 14:17:46,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-02-19 14:17:46,585 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:46,586 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:17:46,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:17:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1931872215, now seen corresponding path program 6 times [2024-02-19 14:17:46,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:17:46,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825859877] [2024-02-19 14:17:46,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 14:17:46,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:46,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:17:46,595 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:17:46,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-02-19 14:17:46,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-02-19 14:17:46,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:17:46,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-19 14:17:46,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:17:47,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-02-19 14:17:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:17:47,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:17:47,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:17:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825859877] [2024-02-19 14:17:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825859877] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:17:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:17:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:17:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146785834] [2024-02-19 14:17:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:17:47,040 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:17:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:17:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:17:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:17:47,041 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:17:47,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 647 transitions, 19301 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:17:47,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:17:47,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:17:47,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:17:50,466 INFO L124 PetriNetUnfolderBase]: 774/1543 cut-off events. [2024-02-19 14:17:50,467 INFO L125 PetriNetUnfolderBase]: For 2499/2499 co-relation queries the response was YES. [2024-02-19 14:17:50,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24343 conditions, 1543 events. 774/1543 cut-off events. For 2499/2499 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8631 event pairs, 12 based on Foata normal form. 18/1560 useless extension candidates. Maximal degree in co-relation 20844. Up to 1507 conditions per place. [2024-02-19 14:17:50,476 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 263 selfloop transitions, 125 changer transitions 373/767 dead transitions. [2024-02-19 14:17:50,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 767 transitions, 24441 flow [2024-02-19 14:17:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:17:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:17:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 431 transitions. [2024-02-19 14:17:50,478 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.513095238095238 [2024-02-19 14:17:50,479 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 131 predicate places. [2024-02-19 14:17:50,480 INFO L507 AbstractCegarLoop]: Abstraction has has 184 places, 767 transitions, 24441 flow [2024-02-19 14:17:50,480 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:17:50,481 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:17:50,481 INFO L234 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-02-19 14:17:50,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-02-19 14:17:50,691 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:50,692 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:17:50,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:17:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -136144585, now seen corresponding path program 7 times [2024-02-19 14:17:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:17:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952231462] [2024-02-19 14:17:50,693 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 14:17:50,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:17:50,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:17:50,694 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:17:50,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-02-19 14:17:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:17:51,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:17:51,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:17:51,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:51,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:51,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:51,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:17:51,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 97 [2024-02-19 14:17:51,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:51,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:51,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:17:51,888 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:51,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:17:51,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:17:51,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 161 [2024-02-19 14:17:52,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:17:52,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-02-19 14:17:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:17:52,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:17:52,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:17:52,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952231462] [2024-02-19 14:17:52,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952231462] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:17:52,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:17:52,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:17:52,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621005639] [2024-02-19 14:17:52,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:17:52,164 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:17:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:17:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:17:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:17:52,323 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:17:52,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 767 transitions, 24441 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:17:52,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:17:52,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:17:52,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:18:09,065 INFO L124 PetriNetUnfolderBase]: 822/1645 cut-off events. [2024-02-19 14:18:09,066 INFO L125 PetriNetUnfolderBase]: For 3090/3090 co-relation queries the response was YES. [2024-02-19 14:18:09,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27565 conditions, 1645 events. 822/1645 cut-off events. For 3090/3090 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9359 event pairs, 8 based on Foata normal form. 1/1645 useless extension candidates. Maximal degree in co-relation 23659. Up to 1606 conditions per place. [2024-02-19 14:18:09,078 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 328 selfloop transitions, 50 changer transitions 446/828 dead transitions. [2024-02-19 14:18:09,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 828 transitions, 28044 flow [2024-02-19 14:18:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:18:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:18:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 339 transitions. [2024-02-19 14:18:09,083 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37666666666666665 [2024-02-19 14:18:09,084 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 145 predicate places. [2024-02-19 14:18:09,084 INFO L507 AbstractCegarLoop]: Abstraction has has 198 places, 828 transitions, 28044 flow [2024-02-19 14:18:09,084 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:18:09,084 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:18:09,084 INFO L234 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-02-19 14:18:09,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-02-19 14:18:09,294 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:18:09,294 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:18:09,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:18:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1191506457, now seen corresponding path program 8 times [2024-02-19 14:18:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:18:09,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600700875] [2024-02-19 14:18:09,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:18:09,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:18:09,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:18:09,297 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:18:09,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-02-19 14:18:09,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:18:09,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:18:09,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:18:09,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:18:09,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:09,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:09,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:09,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:18:10,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:10,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:10,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:10,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:10,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:10,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 129 [2024-02-19 14:18:10,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:18:10,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 261 treesize of output 145 [2024-02-19 14:18:10,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:18:10,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 285 [2024-02-19 14:18:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:18:10,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:18:10,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:18:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600700875] [2024-02-19 14:18:10,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600700875] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:18:10,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:18:10,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:18:10,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293910756] [2024-02-19 14:18:10,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:18:10,705 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:18:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:18:10,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:18:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:18:10,844 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:18:10,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 828 transitions, 28044 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:18:10,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:18:10,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:18:10,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:18:31,073 INFO L124 PetriNetUnfolderBase]: 952/1893 cut-off events. [2024-02-19 14:18:31,073 INFO L125 PetriNetUnfolderBase]: For 3770/3770 co-relation queries the response was YES. [2024-02-19 14:18:31,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33623 conditions, 1893 events. 952/1893 cut-off events. For 3770/3770 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11184 event pairs, 4 based on Foata normal form. 1/1893 useless extension candidates. Maximal degree in co-relation 28704. Up to 1851 conditions per place. [2024-02-19 14:18:31,086 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 340 selfloop transitions, 48 changer transitions 544/936 dead transitions. [2024-02-19 14:18:31,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 936 transitions, 33595 flow [2024-02-19 14:18:31,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:18:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:18:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 344 transitions. [2024-02-19 14:18:31,094 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38222222222222224 [2024-02-19 14:18:31,095 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 159 predicate places. [2024-02-19 14:18:31,095 INFO L507 AbstractCegarLoop]: Abstraction has has 212 places, 936 transitions, 33595 flow [2024-02-19 14:18:31,095 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:18:31,095 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:18:31,095 INFO L234 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-02-19 14:18:31,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-02-19 14:18:31,303 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:18:31,305 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:18:31,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:18:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1191095913, now seen corresponding path program 9 times [2024-02-19 14:18:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:18:31,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623122271] [2024-02-19 14:18:31,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:18:31,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:18:31,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:18:31,321 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:18:31,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-02-19 14:18:31,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-19 14:18:31,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:18:31,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-19 14:18:31,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:18:31,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-02-19 14:18:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:18:31,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:18:31,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:18:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623122271] [2024-02-19 14:18:31,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623122271] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:18:31,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:18:31,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:18:31,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936416681] [2024-02-19 14:18:31,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:18:31,836 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:18:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:18:31,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:18:31,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:18:31,837 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-02-19 14:18:31,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 936 transitions, 33595 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:18:31,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:18:31,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-02-19 14:18:31,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:18:35,865 INFO L124 PetriNetUnfolderBase]: 769/1592 cut-off events. [2024-02-19 14:18:35,865 INFO L125 PetriNetUnfolderBase]: For 4227/4227 co-relation queries the response was YES. [2024-02-19 14:18:35,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29756 conditions, 1592 events. 769/1592 cut-off events. For 4227/4227 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9261 event pairs, 0 based on Foata normal form. 24/1615 useless extension candidates. Maximal degree in co-relation 25111. Up to 1550 conditions per place. [2024-02-19 14:18:35,878 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 229 selfloop transitions, 100 changer transitions 525/860 dead transitions. [2024-02-19 14:18:35,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 860 transitions, 32561 flow [2024-02-19 14:18:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:18:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:18:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 433 transitions. [2024-02-19 14:18:35,880 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5154761904761904 [2024-02-19 14:18:35,880 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 172 predicate places. [2024-02-19 14:18:35,880 INFO L507 AbstractCegarLoop]: Abstraction has has 225 places, 860 transitions, 32561 flow [2024-02-19 14:18:35,881 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-02-19 14:18:35,881 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:18:35,890 INFO L234 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-02-19 14:18:35,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-02-19 14:18:36,099 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:18:36,100 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:18:36,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:18:36,101 INFO L85 PathProgramCache]: Analyzing trace with hash -659209591, now seen corresponding path program 10 times [2024-02-19 14:18:36,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:18:36,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301405954] [2024-02-19 14:18:36,102 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 14:18:36,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:18:36,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:18:36,103 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:18:36,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-02-19 14:18:36,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 14:18:36,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:18:36,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:18:36,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:18:36,584 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:36,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:36,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:36,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:18:37,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 97 [2024-02-19 14:18:37,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:37,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:37,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:37,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:37,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:37,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:18:37,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 161 [2024-02-19 14:18:37,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:18:37,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-02-19 14:18:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:18:37,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:18:37,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:18:37,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301405954] [2024-02-19 14:18:37,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301405954] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:18:37,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:18:37,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:18:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679022292] [2024-02-19 14:18:37,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:18:37,711 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:18:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:18:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:18:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:18:37,795 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:18:37,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 860 transitions, 32561 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:18:37,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:18:37,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:18:37,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:18:52,610 INFO L124 PetriNetUnfolderBase]: 769/1590 cut-off events. [2024-02-19 14:18:52,610 INFO L125 PetriNetUnfolderBase]: For 4710/4710 co-relation queries the response was YES. [2024-02-19 14:18:52,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31304 conditions, 1590 events. 769/1590 cut-off events. For 4710/4710 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9230 event pairs, 0 based on Foata normal form. 1/1590 useless extension candidates. Maximal degree in co-relation 26432. Up to 1549 conditions per place. [2024-02-19 14:18:52,622 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 233 selfloop transitions, 30 changer transitions 599/866 dead transitions. [2024-02-19 14:18:52,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 866 transitions, 34507 flow [2024-02-19 14:18:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:18:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:18:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 311 transitions. [2024-02-19 14:18:52,630 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37023809523809526 [2024-02-19 14:18:52,630 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 185 predicate places. [2024-02-19 14:18:52,630 INFO L507 AbstractCegarLoop]: Abstraction has has 238 places, 866 transitions, 34507 flow [2024-02-19 14:18:52,630 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:18:52,630 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:18:52,631 INFO L234 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-02-19 14:18:52,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-02-19 14:18:52,841 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:18:52,842 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:18:52,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:18:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash -405306733, now seen corresponding path program 11 times [2024-02-19 14:18:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:18:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410769637] [2024-02-19 14:18:52,843 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 14:18:52,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:18:52,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:18:52,845 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:18:52,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-02-19 14:18:53,299 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 14:18:53,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:18:53,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:18:53,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:18:53,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:53,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:53,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:53,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:18:53,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:53,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:53,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:18:53,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:53,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:18:53,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 129 [2024-02-19 14:18:54,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:18:54,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 261 treesize of output 145 [2024-02-19 14:18:54,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:18:54,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 285 [2024-02-19 14:18:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:18:54,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:18:54,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:18:54,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410769637] [2024-02-19 14:18:54,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410769637] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:18:54,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:18:54,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:18:54,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847742446] [2024-02-19 14:18:54,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:18:54,312 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:18:54,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:18:54,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:18:54,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:18:54,434 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:18:54,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 866 transitions, 34507 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:18:54,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:18:54,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:18:54,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:09,212 INFO L124 PetriNetUnfolderBase]: 769/1588 cut-off events. [2024-02-19 14:19:09,212 INFO L125 PetriNetUnfolderBase]: For 5222/5222 co-relation queries the response was YES. [2024-02-19 14:19:09,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32850 conditions, 1588 events. 769/1588 cut-off events. For 5222/5222 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9206 event pairs, 0 based on Foata normal form. 1/1588 useless extension candidates. Maximal degree in co-relation 27753. Up to 1548 conditions per place. [2024-02-19 14:19:09,222 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 140 selfloop transitions, 27 changer transitions 701/872 dead transitions. [2024-02-19 14:19:09,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 872 transitions, 36480 flow [2024-02-19 14:19:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:19:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:19:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 322 transitions. [2024-02-19 14:19:09,227 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-02-19 14:19:09,228 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 198 predicate places. [2024-02-19 14:19:09,228 INFO L507 AbstractCegarLoop]: Abstraction has has 251 places, 872 transitions, 36480 flow [2024-02-19 14:19:09,228 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:19:09,228 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:09,228 INFO L234 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-02-19 14:19:09,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-02-19 14:19:09,436 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:19:09,437 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:19:09,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1976422443, now seen corresponding path program 12 times [2024-02-19 14:19:09,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:19:09,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852119546] [2024-02-19 14:19:09,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 14:19:09,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:19:09,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:19:09,439 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:19:09,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-02-19 14:19:09,893 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-02-19 14:19:09,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:19:09,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:19:09,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:09,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:09,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:09,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:09,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:19:10,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:19:10,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:19:10,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:19:10,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:10,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:10,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 129 [2024-02-19 14:19:10,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:19:10,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 261 treesize of output 145 [2024-02-19 14:19:10,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:19:10,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 285 [2024-02-19 14:19:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:10,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:19:10,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:19:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852119546] [2024-02-19 14:19:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852119546] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:10,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:10,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:19:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424867332] [2024-02-19 14:19:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:10,937 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:19:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:19:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:19:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:19:11,027 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:19:11,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 872 transitions, 36480 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:19:11,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:11,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:19:11,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:27,576 INFO L124 PetriNetUnfolderBase]: 769/1586 cut-off events. [2024-02-19 14:19:27,576 INFO L125 PetriNetUnfolderBase]: For 5771/5771 co-relation queries the response was YES. [2024-02-19 14:19:27,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34394 conditions, 1586 events. 769/1586 cut-off events. For 5771/5771 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9195 event pairs, 0 based on Foata normal form. 1/1586 useless extension candidates. Maximal degree in co-relation 29074. Up to 1547 conditions per place. [2024-02-19 14:19:27,585 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 63 selfloop transitions, 17 changer transitions 787/871 dead transitions. [2024-02-19 14:19:27,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 871 transitions, 38180 flow [2024-02-19 14:19:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:19:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:19:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 337 transitions. [2024-02-19 14:19:27,589 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37444444444444447 [2024-02-19 14:19:27,590 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 212 predicate places. [2024-02-19 14:19:27,590 INFO L507 AbstractCegarLoop]: Abstraction has has 265 places, 871 transitions, 38180 flow [2024-02-19 14:19:27,590 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:19:27,590 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:27,590 INFO L234 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-02-19 14:19:27,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-02-19 14:19:27,796 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:19:27,797 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:19:27,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1251846165, now seen corresponding path program 13 times [2024-02-19 14:19:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 14:19:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719749046] [2024-02-19 14:19:27,798 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 14:19:27,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:19:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 14:19:27,800 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 14:19:27,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-02-19 14:19:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:28,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2024-02-19 14:19:28,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:28,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:28,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:28,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:28,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2024-02-19 14:19:28,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 97 [2024-02-19 14:19:28,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:19:28,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:19:28,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 14:19:28,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:28,981 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:19:28,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:19:28,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 161 [2024-02-19 14:19:29,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:19:29,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-02-19 14:19:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:29,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 14:19:29,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 14:19:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719749046] [2024-02-19 14:19:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719749046] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:29,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:19:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754790388] [2024-02-19 14:19:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:29,216 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 14:19:29,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 14:19:29,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 14:19:29,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-02-19 14:19:29,298 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-19 14:19:29,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 871 transitions, 38180 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:19:29,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:29,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-19 14:19:29,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:50,039 INFO L124 PetriNetUnfolderBase]: 769/1584 cut-off events. [2024-02-19 14:19:50,040 INFO L125 PetriNetUnfolderBase]: For 6331/6331 co-relation queries the response was YES. [2024-02-19 14:19:50,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35936 conditions, 1584 events. 769/1584 cut-off events. For 6331/6331 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9170 event pairs, 0 based on Foata normal form. 1/1584 useless extension candidates. Maximal degree in co-relation 30395. Up to 1546 conditions per place. [2024-02-19 14:19:50,048 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 0 selfloop transitions, 0 changer transitions 869/869 dead transitions. [2024-02-19 14:19:50,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 869 transitions, 39874 flow [2024-02-19 14:19:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:19:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:19:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 343 transitions. [2024-02-19 14:19:50,061 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3811111111111111 [2024-02-19 14:19:50,061 INFO L308 CegarLoopForPetriNet]: 53 programPoint places, 224 predicate places. [2024-02-19 14:19:50,061 INFO L507 AbstractCegarLoop]: Abstraction has has 277 places, 869 transitions, 39874 flow [2024-02-19 14:19:50,061 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-02-19 14:19:50,063 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-02-19 14:19:50,064 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-02-19 14:19:50,064 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-02-19 14:19:50,064 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-02-19 14:19:50,064 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-02-19 14:19:50,065 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-02-19 14:19:50,065 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-02-19 14:19:50,065 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-02-19 14:19:50,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-02-19 14:19:50,276 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 14:19:51,416 INFO L644 CegarLoopForPetriNet]: Computed Owicki-Gries annotation of size 34518 in 1138717716ns [2024-02-19 14:19:51,419 INFO L457 BasicCegarLoop]: Path program histogram: [13, 5, 1, 1, 1, 1] [2024-02-19 14:19:51,422 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-19 14:19:51,437 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Multiple instances of thread not yet supported: 39#L1713-3true at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.OwickiGriesUnpetrifier.computeFormulaMapping(OwickiGriesUnpetrifier.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.OwickiGriesUnpetrifier.(OwickiGriesUnpetrifier.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-02-19 14:19:51,441 INFO L158 Benchmark]: Toolchain (without parser) took 212647.41ms. Allocated memory was 69.2MB in the beginning and 255.9MB in the end (delta: 186.6MB). Free memory was 36.1MB in the beginning and 80.0MB in the end (delta: -43.9MB). Peak memory consumption was 207.0MB. Max. memory is 16.1GB. [2024-02-19 14:19:51,443 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory is still 27.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 14:19:51,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 950.08ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.9MB in the beginning and 53.9MB in the end (delta: -18.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-02-19 14:19:51,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.40ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 50.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-19 14:19:51,444 INFO L158 Benchmark]: Boogie Preprocessor took 60.50ms. Allocated memory is still 83.9MB. Free memory was 50.3MB in the beginning and 44.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-02-19 14:19:51,444 INFO L158 Benchmark]: RCFGBuilder took 812.93ms. Allocated memory was 83.9MB in the beginning and 138.4MB in the end (delta: 54.5MB). Free memory was 44.0MB in the beginning and 99.7MB in the end (delta: -55.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-02-19 14:19:51,444 INFO L158 Benchmark]: TraceAbstraction took 210752.91ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 98.5MB in the beginning and 80.0MB in the end (delta: 18.5MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB. [2024-02-19 14:19:51,446 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.17ms. Allocated memory is still 50.3MB. Free memory is still 27.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 950.08ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.9MB in the beginning and 53.9MB in the end (delta: -18.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.40ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 50.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.50ms. Allocated memory is still 83.9MB. Free memory was 50.3MB in the beginning and 44.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 812.93ms. Allocated memory was 83.9MB in the beginning and 138.4MB in the end (delta: 54.5MB). Free memory was 44.0MB in the beginning and 99.7MB in the end (delta: -55.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 210752.91ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 98.5MB in the beginning and 80.0MB in the end (delta: 18.5MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Multiple instances of thread not yet supported: 39#L1713-3true de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Multiple instances of thread not yet supported: 39#L1713-3true: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.OwickiGriesUnpetrifier.computeFormulaMapping(OwickiGriesUnpetrifier.java:163) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-02-19 14:19:51,478 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: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Multiple instances of thread not yet supported: 39#L1713-3true