./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 23:43:00,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 23:43:00,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 23:43:00,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 23:43:00,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 23:43:00,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 23:43:00,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 23:43:00,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 23:43:00,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 23:43:00,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 23:43:00,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 23:43:00,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 23:43:00,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 23:43:00,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 23:43:00,228 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 23:43:00,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 23:43:00,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 23:43:00,229 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 23:43:00,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 23:43:00,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 23:43:00,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 23:43:00,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 23:43:00,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 23:43:00,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 23:43:00,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 23:43:00,231 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 23:43:00,232 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 23:43:00,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 23:43:00,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 23:43:00,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 23:43:00,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 23:43:00,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 23:43:00,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 23:43:00,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 23:43:00,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:43:00,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 23:43:00,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 23:43:00,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 23:43:00,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 23:43:00,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 23:43:00,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 23:43:00,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 23:43:00,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 23:43:00,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 23:43:00,236 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 ! overflow) ) 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 -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2024-10-14 23:43:00,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 23:43:00,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 23:43:00,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 23:43:00,461 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 23:43:00,462 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 23:43:00,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i [2024-10-14 23:43:01,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 23:43:01,893 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 23:43:01,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i [2024-10-14 23:43:01,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6845d8c04/8edae1c3d02a4e008e4026dfaac71e3f/FLAG157cd0e04 [2024-10-14 23:43:01,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6845d8c04/8edae1c3d02a4e008e4026dfaac71e3f [2024-10-14 23:43:01,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 23:43:01,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 23:43:01,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 23:43:01,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 23:43:01,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 23:43:01,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:43:01" (1/1) ... [2024-10-14 23:43:01,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1d1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:01, skipping insertion in model container [2024-10-14 23:43:01,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:43:01" (1/1) ... [2024-10-14 23:43:01,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 23:43:02,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:43:02,351 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 23:43:02,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:43:02,447 INFO L204 MainTranslator]: Completed translation [2024-10-14 23:43:02,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02 WrapperNode [2024-10-14 23:43:02,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 23:43:02,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 23:43:02,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 23:43:02,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 23:43:02,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,505 INFO L138 Inliner]: procedures = 274, calls = 56, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 263 [2024-10-14 23:43:02,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 23:43:02,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 23:43:02,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 23:43:02,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 23:43:02,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,536 INFO L175 MemorySlicer]: Split 43 memory accesses to 4 slices as follows [2, 5, 4, 32]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 18 writes are split as follows [0, 0, 3, 15]. [2024-10-14 23:43:02,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 23:43:02,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 23:43:02,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 23:43:02,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 23:43:02,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (1/1) ... [2024-10-14 23:43:02,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:43:02,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:43:02,586 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-10-14 23:43:02,588 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-10-14 23:43:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-14 23:43:02,620 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-14 23:43:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-14 23:43:02,620 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-14 23:43:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 23:43:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 23:43:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 23:43:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 23:43:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 23:43:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 23:43:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 23:43:02,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 23:43:02,624 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 23:43:02,740 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 23:43:02,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 23:43:03,028 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 23:43:03,028 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 23:43:03,220 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 23:43:03,221 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 23:43:03,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:43:03 BoogieIcfgContainer [2024-10-14 23:43:03,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 23:43:03,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 23:43:03,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 23:43:03,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 23:43:03,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:43:01" (1/3) ... [2024-10-14 23:43:03,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595f51f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:43:03, skipping insertion in model container [2024-10-14 23:43:03,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:02" (2/3) ... [2024-10-14 23:43:03,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595f51f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:43:03, skipping insertion in model container [2024-10-14 23:43:03,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:43:03" (3/3) ... [2024-10-14 23:43:03,228 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-10-14 23:43:03,241 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 23:43:03,241 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-14 23:43:03,242 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 23:43:03,308 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 23:43:03,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 83 transitions, 180 flow [2024-10-14 23:43:03,364 INFO L124 PetriNetUnfolderBase]: 9/81 cut-off events. [2024-10-14 23:43:03,364 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 23:43:03,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 9/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 208 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2024-10-14 23:43:03,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 83 transitions, 180 flow [2024-10-14 23:43:03,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 79 transitions, 167 flow [2024-10-14 23:43:03,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 23:43:03,418 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ec9f07f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 23:43:03,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-10-14 23:43:03,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 23:43:03,432 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-10-14 23:43:03,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 23:43:03,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:03,450 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 23:43:03,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:03,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -593102147, now seen corresponding path program 1 times [2024-10-14 23:43:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474019241] [2024-10-14 23:43:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:03,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:03,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:03,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474019241] [2024-10-14 23:43:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474019241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:03,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:03,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:43:03,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442036871] [2024-10-14 23:43:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:43:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:03,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:43:03,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:43:03,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:04,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-10-14 23:43:04,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:04,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:04,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:04,425 INFO L124 PetriNetUnfolderBase]: 1242/2581 cut-off events. [2024-10-14 23:43:04,425 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 23:43:04,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4578 conditions, 2581 events. 1242/2581 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 16513 event pairs, 264 based on Foata normal form. 60/2265 useless extension candidates. Maximal degree in co-relation 4506. Up to 1757 conditions per place. [2024-10-14 23:43:04,439 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 81 selfloop transitions, 6 changer transitions 0/117 dead transitions. [2024-10-14 23:43:04,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 423 flow [2024-10-14 23:43:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 23:43:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 23:43:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2024-10-14 23:43:04,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6072289156626506 [2024-10-14 23:43:04,450 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 167 flow. Second operand 5 states and 252 transitions. [2024-10-14 23:43:04,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 423 flow [2024-10-14 23:43:04,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 117 transitions, 416 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 23:43:04,458 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 206 flow [2024-10-14 23:43:04,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2024-10-14 23:43:04,463 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2024-10-14 23:43:04,464 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 206 flow [2024-10-14 23:43:04,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-10-14 23:43:04,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:04,465 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:04,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 23:43:04,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:04,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 390145210, now seen corresponding path program 1 times [2024-10-14 23:43:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:04,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586433045] [2024-10-14 23:43:04,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586433045] [2024-10-14 23:43:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586433045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:04,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:04,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:43:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562172801] [2024-10-14 23:43:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:04,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 23:43:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:04,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 23:43:04,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 23:43:04,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:04,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-10-14 23:43:04,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:04,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:04,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:04,960 INFO L124 PetriNetUnfolderBase]: 1326/2695 cut-off events. [2024-10-14 23:43:04,960 INFO L125 PetriNetUnfolderBase]: For 348/354 co-relation queries the response was YES. [2024-10-14 23:43:04,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5141 conditions, 2695 events. 1326/2695 cut-off events. For 348/354 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 17130 event pairs, 266 based on Foata normal form. 40/2367 useless extension candidates. Maximal degree in co-relation 4879. Up to 1807 conditions per place. [2024-10-14 23:43:04,972 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 102 selfloop transitions, 11 changer transitions 0/143 dead transitions. [2024-10-14 23:43:04,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 143 transitions, 572 flow [2024-10-14 23:43:04,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 23:43:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 23:43:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2024-10-14 23:43:04,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5851979345955249 [2024-10-14 23:43:04,975 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 206 flow. Second operand 7 states and 340 transitions. [2024-10-14 23:43:04,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 143 transitions, 572 flow [2024-10-14 23:43:04,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 572 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 23:43:04,978 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 275 flow [2024-10-14 23:43:04,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-10-14 23:43:04,979 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2024-10-14 23:43:04,979 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 275 flow [2024-10-14 23:43:04,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-10-14 23:43:04,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:04,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:04,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 23:43:04,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:04,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash -743114382, now seen corresponding path program 1 times [2024-10-14 23:43:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:04,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510331809] [2024-10-14 23:43:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:05,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:05,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510331809] [2024-10-14 23:43:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510331809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:05,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:05,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:43:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525849705] [2024-10-14 23:43:05,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:05,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:43:05,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:05,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:43:05,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:43:05,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2024-10-14 23:43:05,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:05,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:05,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2024-10-14 23:43:05,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:05,266 INFO L124 PetriNetUnfolderBase]: 1023/2371 cut-off events. [2024-10-14 23:43:05,266 INFO L125 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2024-10-14 23:43:05,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4328 conditions, 2371 events. 1023/2371 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13907 event pairs, 483 based on Foata normal form. 41/2110 useless extension candidates. Maximal degree in co-relation 4318. Up to 884 conditions per place. [2024-10-14 23:43:05,277 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 63 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-10-14 23:43:05,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 366 flow [2024-10-14 23:43:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:43:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 23:43:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2024-10-14 23:43:05,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7028112449799196 [2024-10-14 23:43:05,282 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 275 flow. Second operand 3 states and 175 transitions. [2024-10-14 23:43:05,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 366 flow [2024-10-14 23:43:05,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 331 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-10-14 23:43:05,287 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 167 flow [2024-10-14 23:43:05,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2024-10-14 23:43:05,288 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -2 predicate places. [2024-10-14 23:43:05,288 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 167 flow [2024-10-14 23:43:05,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:05,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:05,288 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:05,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 23:43:05,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:05,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1168355787, now seen corresponding path program 1 times [2024-10-14 23:43:05,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:05,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21751948] [2024-10-14 23:43:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:05,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:05,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21751948] [2024-10-14 23:43:05,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21751948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:05,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:05,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:43:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844060564] [2024-10-14 23:43:05,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:05,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:43:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:05,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:43:05,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:43:05,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-10-14 23:43:05,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:05,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:05,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-10-14 23:43:05,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:05,731 INFO L124 PetriNetUnfolderBase]: 1890/4150 cut-off events. [2024-10-14 23:43:05,732 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2024-10-14 23:43:05,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7404 conditions, 4150 events. 1890/4150 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 26961 event pairs, 949 based on Foata normal form. 138/3770 useless extension candidates. Maximal degree in co-relation 7398. Up to 1977 conditions per place. [2024-10-14 23:43:05,750 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 112 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2024-10-14 23:43:05,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 143 transitions, 550 flow [2024-10-14 23:43:05,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:43:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 23:43:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2024-10-14 23:43:05,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7560240963855421 [2024-10-14 23:43:05,752 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 167 flow. Second operand 4 states and 251 transitions. [2024-10-14 23:43:05,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 143 transitions, 550 flow [2024-10-14 23:43:05,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 143 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 23:43:05,755 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 188 flow [2024-10-14 23:43:05,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2024-10-14 23:43:05,756 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2024-10-14 23:43:05,756 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 188 flow [2024-10-14 23:43:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:05,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:05,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:05,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 23:43:05,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:05,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash -60220822, now seen corresponding path program 1 times [2024-10-14 23:43:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:05,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810606785] [2024-10-14 23:43:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810606785] [2024-10-14 23:43:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810606785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:05,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:05,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 23:43:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235861267] [2024-10-14 23:43:05,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:05,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 23:43:05,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 23:43:05,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 23:43:05,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2024-10-14 23:43:05,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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-10-14 23:43:05,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:05,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2024-10-14 23:43:05,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:06,315 INFO L124 PetriNetUnfolderBase]: 1715/3860 cut-off events. [2024-10-14 23:43:06,316 INFO L125 PetriNetUnfolderBase]: For 786/906 co-relation queries the response was YES. [2024-10-14 23:43:06,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 3860 events. 1715/3860 cut-off events. For 786/906 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 25054 event pairs, 279 based on Foata normal form. 0/3418 useless extension candidates. Maximal degree in co-relation 7356. Up to 2409 conditions per place. [2024-10-14 23:43:06,333 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 74 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-10-14 23:43:06,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 464 flow [2024-10-14 23:43:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 23:43:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 23:43:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2024-10-14 23:43:06,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6048192771084338 [2024-10-14 23:43:06,336 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 188 flow. Second operand 5 states and 251 transitions. [2024-10-14 23:43:06,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 464 flow [2024-10-14 23:43:06,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 23:43:06,338 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 194 flow [2024-10-14 23:43:06,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2024-10-14 23:43:06,339 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2024-10-14 23:43:06,339 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 194 flow [2024-10-14 23:43:06,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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-10-14 23:43:06,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:06,341 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:06,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 23:43:06,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:06,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2052147989, now seen corresponding path program 1 times [2024-10-14 23:43:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345762841] [2024-10-14 23:43:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345762841] [2024-10-14 23:43:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345762841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 23:43:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471755401] [2024-10-14 23:43:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:06,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 23:43:06,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:43:06,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 23:43:06,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 23:43:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:06,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 23:43:06,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:43:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:06,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:43:06,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471755401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:06,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 23:43:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-14 23:43:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493096890] [2024-10-14 23:43:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:06,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 23:43:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 23:43:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 23:43:06,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2024-10-14 23:43:06,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 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-10-14 23:43:06,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:06,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2024-10-14 23:43:06,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:06,915 INFO L124 PetriNetUnfolderBase]: 1912/3875 cut-off events. [2024-10-14 23:43:06,915 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2024-10-14 23:43:06,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 3875 events. 1912/3875 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 23695 event pairs, 118 based on Foata normal form. 70/3579 useless extension candidates. Maximal degree in co-relation 7845. Up to 1906 conditions per place. [2024-10-14 23:43:06,929 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 99 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2024-10-14 23:43:06,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 536 flow [2024-10-14 23:43:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:43:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 23:43:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2024-10-14 23:43:06,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2024-10-14 23:43:06,931 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 194 flow. Second operand 4 states and 232 transitions. [2024-10-14 23:43:06,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 536 flow [2024-10-14 23:43:06,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 131 transitions, 510 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 23:43:06,935 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 190 flow [2024-10-14 23:43:06,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2024-10-14 23:43:06,936 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2024-10-14 23:43:06,937 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 190 flow [2024-10-14 23:43:06,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 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-10-14 23:43:06,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:06,937 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:06,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 23:43:07,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 23:43:07,139 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:07,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash 746321772, now seen corresponding path program 1 times [2024-10-14 23:43:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317831206] [2024-10-14 23:43:07,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:07,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:07,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-10-14 23:43:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:07,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317831206] [2024-10-14 23:43:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317831206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:07,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 23:43:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143973023] [2024-10-14 23:43:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:07,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 23:43:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 23:43:07,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 23:43:07,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:07,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:07,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:07,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:07,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:07,917 INFO L124 PetriNetUnfolderBase]: 2088/4452 cut-off events. [2024-10-14 23:43:07,917 INFO L125 PetriNetUnfolderBase]: For 1764/1830 co-relation queries the response was YES. [2024-10-14 23:43:07,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9092 conditions, 4452 events. 2088/4452 cut-off events. For 1764/1830 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 29085 event pairs, 404 based on Foata normal form. 22/3979 useless extension candidates. Maximal degree in co-relation 9084. Up to 2096 conditions per place. [2024-10-14 23:43:07,938 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 111 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2024-10-14 23:43:07,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 145 transitions, 701 flow [2024-10-14 23:43:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 23:43:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 23:43:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 330 transitions. [2024-10-14 23:43:07,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5679862306368331 [2024-10-14 23:43:07,940 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 190 flow. Second operand 7 states and 330 transitions. [2024-10-14 23:43:07,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 145 transitions, 701 flow [2024-10-14 23:43:07,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 145 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 23:43:07,944 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 216 flow [2024-10-14 23:43:07,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2024-10-14 23:43:07,945 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 9 predicate places. [2024-10-14 23:43:07,945 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 216 flow [2024-10-14 23:43:07,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:07,946 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:07,946 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:07,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 23:43:07,946 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:07,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash 807922598, now seen corresponding path program 1 times [2024-10-14 23:43:07,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:07,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724307050] [2024-10-14 23:43:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 23:43:07,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724307050] [2024-10-14 23:43:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724307050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:07,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:43:07,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159298375] [2024-10-14 23:43:07,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:07,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:43:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:07,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:43:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:43:07,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2024-10-14 23:43:07,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-10-14 23:43:07,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:07,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2024-10-14 23:43:07,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:08,311 INFO L124 PetriNetUnfolderBase]: 1999/4229 cut-off events. [2024-10-14 23:43:08,312 INFO L125 PetriNetUnfolderBase]: For 952/1044 co-relation queries the response was YES. [2024-10-14 23:43:08,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8570 conditions, 4229 events. 1999/4229 cut-off events. For 952/1044 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 27399 event pairs, 349 based on Foata normal form. 38/3953 useless extension candidates. Maximal degree in co-relation 8560. Up to 1995 conditions per place. [2024-10-14 23:43:08,328 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 98 selfloop transitions, 6 changer transitions 6/138 dead transitions. [2024-10-14 23:43:08,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 138 transitions, 602 flow [2024-10-14 23:43:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:43:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 23:43:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2024-10-14 23:43:08,329 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2024-10-14 23:43:08,329 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 216 flow. Second operand 4 states and 232 transitions. [2024-10-14 23:43:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 138 transitions, 602 flow [2024-10-14 23:43:08,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 138 transitions, 586 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 23:43:08,333 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 222 flow [2024-10-14 23:43:08,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2024-10-14 23:43:08,334 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 9 predicate places. [2024-10-14 23:43:08,334 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 222 flow [2024-10-14 23:43:08,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-10-14 23:43:08,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:08,334 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:08,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 23:43:08,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:08,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1661139235, now seen corresponding path program 1 times [2024-10-14 23:43:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460098419] [2024-10-14 23:43:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460098419] [2024-10-14 23:43:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460098419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 23:43:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891710862] [2024-10-14 23:43:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:08,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 23:43:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 23:43:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:43:08,935 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2024-10-14 23:43:08,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:08,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:08,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2024-10-14 23:43:08,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:09,462 INFO L124 PetriNetUnfolderBase]: 2223/4643 cut-off events. [2024-10-14 23:43:09,463 INFO L125 PetriNetUnfolderBase]: For 2875/2875 co-relation queries the response was YES. [2024-10-14 23:43:09,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10133 conditions, 4643 events. 2223/4643 cut-off events. For 2875/2875 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 30274 event pairs, 444 based on Foata normal form. 22/4255 useless extension candidates. Maximal degree in co-relation 10122. Up to 2448 conditions per place. [2024-10-14 23:43:09,486 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 129 selfloop transitions, 8 changer transitions 2/164 dead transitions. [2024-10-14 23:43:09,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 882 flow [2024-10-14 23:43:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 23:43:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 23:43:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 375 transitions. [2024-10-14 23:43:09,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5020080321285141 [2024-10-14 23:43:09,488 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 222 flow. Second operand 9 states and 375 transitions. [2024-10-14 23:43:09,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 164 transitions, 882 flow [2024-10-14 23:43:09,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 164 transitions, 822 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 23:43:09,493 INFO L231 Difference]: Finished difference. Result has 90 places, 75 transitions, 223 flow [2024-10-14 23:43:09,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2024-10-14 23:43:09,495 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2024-10-14 23:43:09,496 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 223 flow [2024-10-14 23:43:09,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:09,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:09,496 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:09,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 23:43:09,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:09,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash -44322257, now seen corresponding path program 1 times [2024-10-14 23:43:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:09,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370231265] [2024-10-14 23:43:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:09,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370231265] [2024-10-14 23:43:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370231265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:09,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:09,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:43:09,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418955684] [2024-10-14 23:43:09,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:09,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:43:09,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:09,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:43:09,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:43:09,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:09,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:09,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:09,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:09,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:10,001 INFO L124 PetriNetUnfolderBase]: 2829/5809 cut-off events. [2024-10-14 23:43:10,002 INFO L125 PetriNetUnfolderBase]: For 2571/2581 co-relation queries the response was YES. [2024-10-14 23:43:10,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12573 conditions, 5809 events. 2829/5809 cut-off events. For 2571/2581 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 39951 event pairs, 1541 based on Foata normal form. 144/5567 useless extension candidates. Maximal degree in co-relation 12561. Up to 3623 conditions per place. [2024-10-14 23:43:10,029 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 92 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2024-10-14 23:43:10,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 120 transitions, 568 flow [2024-10-14 23:43:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:43:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 23:43:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-10-14 23:43:10,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6596385542168675 [2024-10-14 23:43:10,031 INFO L175 Difference]: Start difference. First operand has 90 places, 75 transitions, 223 flow. Second operand 4 states and 219 transitions. [2024-10-14 23:43:10,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 120 transitions, 568 flow [2024-10-14 23:43:10,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 120 transitions, 552 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 23:43:10,036 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 238 flow [2024-10-14 23:43:10,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2024-10-14 23:43:10,037 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 12 predicate places. [2024-10-14 23:43:10,037 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 238 flow [2024-10-14 23:43:10,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:10,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:10,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:10,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 23:43:10,038 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:10,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1373004120, now seen corresponding path program 1 times [2024-10-14 23:43:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:10,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209615846] [2024-10-14 23:43:10,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:10,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:10,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209615846] [2024-10-14 23:43:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209615846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:10,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:10,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 23:43:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154669414] [2024-10-14 23:43:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:10,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 23:43:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:10,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 23:43:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:43:10,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:10,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 238 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 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-10-14 23:43:10,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:10,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:10,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:10,931 INFO L124 PetriNetUnfolderBase]: 2825/5927 cut-off events. [2024-10-14 23:43:10,931 INFO L125 PetriNetUnfolderBase]: For 2572/2638 co-relation queries the response was YES. [2024-10-14 23:43:10,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13313 conditions, 5927 events. 2825/5927 cut-off events. For 2572/2638 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 41327 event pairs, 484 based on Foata normal form. 44/5601 useless extension candidates. Maximal degree in co-relation 13298. Up to 2530 conditions per place. [2024-10-14 23:43:10,955 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 147 selfloop transitions, 14 changer transitions 2/190 dead transitions. [2024-10-14 23:43:10,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 190 transitions, 988 flow [2024-10-14 23:43:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 23:43:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 23:43:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 461 transitions. [2024-10-14 23:43:10,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.555421686746988 [2024-10-14 23:43:10,959 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 238 flow. Second operand 10 states and 461 transitions. [2024-10-14 23:43:10,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 190 transitions, 988 flow [2024-10-14 23:43:10,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 190 transitions, 985 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 23:43:10,964 INFO L231 Difference]: Finished difference. Result has 100 places, 84 transitions, 309 flow [2024-10-14 23:43:10,965 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=309, PETRI_PLACES=100, PETRI_TRANSITIONS=84} [2024-10-14 23:43:10,965 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 23 predicate places. [2024-10-14 23:43:10,965 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 84 transitions, 309 flow [2024-10-14 23:43:10,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 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-10-14 23:43:10,966 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:10,966 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:10,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 23:43:10,966 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:10,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash 386546034, now seen corresponding path program 1 times [2024-10-14 23:43:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:10,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289789618] [2024-10-14 23:43:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:10,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289789618] [2024-10-14 23:43:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289789618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:11,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:11,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 23:43:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421347939] [2024-10-14 23:43:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 23:43:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:11,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 23:43:11,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:43:11,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:11,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 84 transitions, 309 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 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-10-14 23:43:11,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:11,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:11,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:11,843 INFO L124 PetriNetUnfolderBase]: 2825/5927 cut-off events. [2024-10-14 23:43:11,843 INFO L125 PetriNetUnfolderBase]: For 3533/3599 co-relation queries the response was YES. [2024-10-14 23:43:11,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14531 conditions, 5927 events. 2825/5927 cut-off events. For 3533/3599 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 41374 event pairs, 484 based on Foata normal form. 44/5809 useless extension candidates. Maximal degree in co-relation 14514. Up to 2682 conditions per place. [2024-10-14 23:43:11,867 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 147 selfloop transitions, 14 changer transitions 2/190 dead transitions. [2024-10-14 23:43:11,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 190 transitions, 1050 flow [2024-10-14 23:43:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 23:43:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 23:43:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 460 transitions. [2024-10-14 23:43:11,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5542168674698795 [2024-10-14 23:43:11,869 INFO L175 Difference]: Start difference. First operand has 100 places, 84 transitions, 309 flow. Second operand 10 states and 460 transitions. [2024-10-14 23:43:11,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 190 transitions, 1050 flow [2024-10-14 23:43:11,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 190 transitions, 1038 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 23:43:11,878 INFO L231 Difference]: Finished difference. Result has 105 places, 84 transitions, 335 flow [2024-10-14 23:43:11,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=335, PETRI_PLACES=105, PETRI_TRANSITIONS=84} [2024-10-14 23:43:11,879 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 28 predicate places. [2024-10-14 23:43:11,879 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 335 flow [2024-10-14 23:43:11,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 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-10-14 23:43:11,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:11,880 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:11,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 23:43:11,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:11,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1145090277, now seen corresponding path program 1 times [2024-10-14 23:43:11,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:11,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87667559] [2024-10-14 23:43:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:11,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87667559] [2024-10-14 23:43:11,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87667559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 23:43:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089966834] [2024-10-14 23:43:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:11,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 23:43:11,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:43:11,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 23:43:11,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 23:43:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:12,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 23:43:12,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:43:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:12,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:43:12,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089966834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:12,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 23:43:12,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-14 23:43:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825098205] [2024-10-14 23:43:12,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:12,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 23:43:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:12,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 23:43:12,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:43:12,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:12,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 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-10-14 23:43:12,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:12,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:12,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:12,563 INFO L124 PetriNetUnfolderBase]: 2796/5782 cut-off events. [2024-10-14 23:43:12,563 INFO L125 PetriNetUnfolderBase]: For 4277/4277 co-relation queries the response was YES. [2024-10-14 23:43:12,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14827 conditions, 5782 events. 2796/5782 cut-off events. For 4277/4277 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 39460 event pairs, 343 based on Foata normal form. 150/5754 useless extension candidates. Maximal degree in co-relation 14808. Up to 2529 conditions per place. [2024-10-14 23:43:12,582 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 124 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2024-10-14 23:43:12,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 154 transitions, 886 flow [2024-10-14 23:43:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 23:43:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 23:43:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 302 transitions. [2024-10-14 23:43:12,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.606425702811245 [2024-10-14 23:43:12,583 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 335 flow. Second operand 6 states and 302 transitions. [2024-10-14 23:43:12,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 154 transitions, 886 flow [2024-10-14 23:43:12,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 154 transitions, 867 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 23:43:12,593 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 323 flow [2024-10-14 23:43:12,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2024-10-14 23:43:12,593 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 25 predicate places. [2024-10-14 23:43:12,594 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 323 flow [2024-10-14 23:43:12,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 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-10-14 23:43:12,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:12,594 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:12,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 23:43:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 23:43:12,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1138061008, now seen corresponding path program 1 times [2024-10-14 23:43:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848442506] [2024-10-14 23:43:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 23:43:12,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:12,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848442506] [2024-10-14 23:43:12,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848442506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:12,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:12,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:43:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894017761] [2024-10-14 23:43:12,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:12,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:43:12,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:12,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:43:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:43:12,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2024-10-14 23:43:12,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-10-14 23:43:12,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:12,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2024-10-14 23:43:12,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:13,242 INFO L124 PetriNetUnfolderBase]: 2756/5644 cut-off events. [2024-10-14 23:43:13,242 INFO L125 PetriNetUnfolderBase]: For 4492/4512 co-relation queries the response was YES. [2024-10-14 23:43:13,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14573 conditions, 5644 events. 2756/5644 cut-off events. For 4492/4512 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 37993 event pairs, 736 based on Foata normal form. 150/5654 useless extension candidates. Maximal degree in co-relation 14553. Up to 2857 conditions per place. [2024-10-14 23:43:13,261 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 85 selfloop transitions, 6 changer transitions 0/115 dead transitions. [2024-10-14 23:43:13,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 115 transitions, 627 flow [2024-10-14 23:43:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:43:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 23:43:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2024-10-14 23:43:13,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5993975903614458 [2024-10-14 23:43:13,262 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 323 flow. Second operand 4 states and 199 transitions. [2024-10-14 23:43:13,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 115 transitions, 627 flow [2024-10-14 23:43:13,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 115 transitions, 618 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-10-14 23:43:13,271 INFO L231 Difference]: Finished difference. Result has 100 places, 81 transitions, 326 flow [2024-10-14 23:43:13,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=100, PETRI_TRANSITIONS=81} [2024-10-14 23:43:13,272 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 23 predicate places. [2024-10-14 23:43:13,272 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 81 transitions, 326 flow [2024-10-14 23:43:13,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-10-14 23:43:13,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:13,273 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:13,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 23:43:13,273 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:13,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:13,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1087901964, now seen corresponding path program 1 times [2024-10-14 23:43:13,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:13,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529124475] [2024-10-14 23:43:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:13,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529124475] [2024-10-14 23:43:13,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529124475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:13,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:13,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:43:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611981907] [2024-10-14 23:43:13,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:13,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:43:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:13,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:43:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:43:13,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2024-10-14 23:43:13,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 81 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-10-14 23:43:13,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:13,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2024-10-14 23:43:13,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:13,557 INFO L124 PetriNetUnfolderBase]: 1742/3959 cut-off events. [2024-10-14 23:43:13,557 INFO L125 PetriNetUnfolderBase]: For 4086/4086 co-relation queries the response was YES. [2024-10-14 23:43:13,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10594 conditions, 3959 events. 1742/3959 cut-off events. For 4086/4086 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 25862 event pairs, 514 based on Foata normal form. 168/4049 useless extension candidates. Maximal degree in co-relation 10575. Up to 1962 conditions per place. [2024-10-14 23:43:13,573 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 64 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2024-10-14 23:43:13,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 96 transitions, 533 flow [2024-10-14 23:43:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:43:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 23:43:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2024-10-14 23:43:13,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2024-10-14 23:43:13,574 INFO L175 Difference]: Start difference. First operand has 100 places, 81 transitions, 326 flow. Second operand 3 states and 165 transitions. [2024-10-14 23:43:13,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 96 transitions, 533 flow [2024-10-14 23:43:13,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 96 transitions, 514 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-14 23:43:13,580 INFO L231 Difference]: Finished difference. Result has 100 places, 79 transitions, 308 flow [2024-10-14 23:43:13,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=100, PETRI_TRANSITIONS=79} [2024-10-14 23:43:13,581 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 23 predicate places. [2024-10-14 23:43:13,582 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 79 transitions, 308 flow [2024-10-14 23:43:13,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-10-14 23:43:13,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:13,582 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 23:43:13,582 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:13,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1038421454, now seen corresponding path program 1 times [2024-10-14 23:43:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991189067] [2024-10-14 23:43:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:14,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:14,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991189067] [2024-10-14 23:43:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991189067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:14,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:14,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 23:43:14,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248198576] [2024-10-14 23:43:14,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:14,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 23:43:14,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:14,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 23:43:14,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 23:43:14,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2024-10-14 23:43:14,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 79 transitions, 308 flow. Second operand has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 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-10-14 23:43:14,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:14,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2024-10-14 23:43:14,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:15,098 INFO L124 PetriNetUnfolderBase]: 2920/6132 cut-off events. [2024-10-14 23:43:15,098 INFO L125 PetriNetUnfolderBase]: For 5683/5683 co-relation queries the response was YES. [2024-10-14 23:43:15,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16820 conditions, 6132 events. 2920/6132 cut-off events. For 5683/5683 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 41637 event pairs, 247 based on Foata normal form. 70/6050 useless extension candidates. Maximal degree in co-relation 16800. Up to 1706 conditions per place. [2024-10-14 23:43:15,123 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 208 selfloop transitions, 20 changer transitions 2/250 dead transitions. [2024-10-14 23:43:15,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 250 transitions, 1528 flow [2024-10-14 23:43:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 23:43:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-14 23:43:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 605 transitions. [2024-10-14 23:43:15,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4555722891566265 [2024-10-14 23:43:15,126 INFO L175 Difference]: Start difference. First operand has 100 places, 79 transitions, 308 flow. Second operand 16 states and 605 transitions. [2024-10-14 23:43:15,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 250 transitions, 1528 flow [2024-10-14 23:43:15,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 250 transitions, 1508 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 23:43:15,135 INFO L231 Difference]: Finished difference. Result has 120 places, 90 transitions, 427 flow [2024-10-14 23:43:15,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=427, PETRI_PLACES=120, PETRI_TRANSITIONS=90} [2024-10-14 23:43:15,136 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 43 predicate places. [2024-10-14 23:43:15,136 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 90 transitions, 427 flow [2024-10-14 23:43:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 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-10-14 23:43:15,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:15,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:15,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 23:43:15,136 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1990538165, now seen corresponding path program 1 times [2024-10-14 23:43:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203626170] [2024-10-14 23:43:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203626170] [2024-10-14 23:43:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203626170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:15,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:15,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 23:43:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182745563] [2024-10-14 23:43:15,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:15,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 23:43:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:15,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 23:43:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:43:15,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-10-14 23:43:15,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 90 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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-10-14 23:43:15,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:15,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-10-14 23:43:15,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:15,727 INFO L124 PetriNetUnfolderBase]: 2612/5758 cut-off events. [2024-10-14 23:43:15,727 INFO L125 PetriNetUnfolderBase]: For 6906/6906 co-relation queries the response was YES. [2024-10-14 23:43:15,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16309 conditions, 5758 events. 2612/5758 cut-off events. For 6906/6906 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 40377 event pairs, 1497 based on Foata normal form. 52/5716 useless extension candidates. Maximal degree in co-relation 16283. Up to 3017 conditions per place. [2024-10-14 23:43:15,748 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 62 selfloop transitions, 18 changer transitions 0/104 dead transitions. [2024-10-14 23:43:15,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 104 transitions, 650 flow [2024-10-14 23:43:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 23:43:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 23:43:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-10-14 23:43:15,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2024-10-14 23:43:15,749 INFO L175 Difference]: Start difference. First operand has 120 places, 90 transitions, 427 flow. Second operand 5 states and 225 transitions. [2024-10-14 23:43:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 104 transitions, 650 flow [2024-10-14 23:43:15,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 104 transitions, 619 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-10-14 23:43:15,762 INFO L231 Difference]: Finished difference. Result has 113 places, 88 transitions, 423 flow [2024-10-14 23:43:15,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=113, PETRI_TRANSITIONS=88} [2024-10-14 23:43:15,763 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 36 predicate places. [2024-10-14 23:43:15,763 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 88 transitions, 423 flow [2024-10-14 23:43:15,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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-10-14 23:43:15,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:15,763 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:15,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 23:43:15,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:15,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1699143016, now seen corresponding path program 1 times [2024-10-14 23:43:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736693933] [2024-10-14 23:43:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:15,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:15,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736693933] [2024-10-14 23:43:15,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736693933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:15,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:15,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:43:15,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123471765] [2024-10-14 23:43:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:15,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:43:15,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:15,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:43:15,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:43:15,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2024-10-14 23:43:15,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 88 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-10-14 23:43:15,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:15,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2024-10-14 23:43:15,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:16,154 INFO L124 PetriNetUnfolderBase]: 2128/4716 cut-off events. [2024-10-14 23:43:16,154 INFO L125 PetriNetUnfolderBase]: For 5541/5541 co-relation queries the response was YES. [2024-10-14 23:43:16,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13071 conditions, 4716 events. 2128/4716 cut-off events. For 5541/5541 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 31162 event pairs, 1127 based on Foata normal form. 48/4668 useless extension candidates. Maximal degree in co-relation 13046. Up to 2014 conditions per place. [2024-10-14 23:43:16,174 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 74 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-10-14 23:43:16,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 101 transitions, 615 flow [2024-10-14 23:43:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:43:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 23:43:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2024-10-14 23:43:16,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2024-10-14 23:43:16,177 INFO L175 Difference]: Start difference. First operand has 113 places, 88 transitions, 423 flow. Second operand 3 states and 165 transitions. [2024-10-14 23:43:16,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 101 transitions, 615 flow [2024-10-14 23:43:16,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 567 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-10-14 23:43:16,189 INFO L231 Difference]: Finished difference. Result has 107 places, 82 transitions, 341 flow [2024-10-14 23:43:16,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=107, PETRI_TRANSITIONS=82} [2024-10-14 23:43:16,189 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 30 predicate places. [2024-10-14 23:43:16,189 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 82 transitions, 341 flow [2024-10-14 23:43:16,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-10-14 23:43:16,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:16,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:16,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 23:43:16,190 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:16,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1646755898, now seen corresponding path program 1 times [2024-10-14 23:43:16,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:16,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804720165] [2024-10-14 23:43:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804720165] [2024-10-14 23:43:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804720165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 23:43:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135729621] [2024-10-14 23:43:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:16,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 23:43:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 23:43:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-14 23:43:16,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2024-10-14 23:43:16,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 82 transitions, 341 flow. Second operand has 11 states, 11 states have (on average 32.54545454545455) internal successors, (358), 11 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:16,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:16,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2024-10-14 23:43:16,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:17,365 INFO L124 PetriNetUnfolderBase]: 2279/4857 cut-off events. [2024-10-14 23:43:17,366 INFO L125 PetriNetUnfolderBase]: For 4777/4779 co-relation queries the response was YES. [2024-10-14 23:43:17,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13319 conditions, 4857 events. 2279/4857 cut-off events. For 4777/4779 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 31083 event pairs, 301 based on Foata normal form. 26/4785 useless extension candidates. Maximal degree in co-relation 13295. Up to 1198 conditions per place. [2024-10-14 23:43:17,381 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 168 selfloop transitions, 20 changer transitions 10/219 dead transitions. [2024-10-14 23:43:17,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 219 transitions, 1340 flow [2024-10-14 23:43:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 23:43:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-14 23:43:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 644 transitions. [2024-10-14 23:43:17,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48493975903614456 [2024-10-14 23:43:17,384 INFO L175 Difference]: Start difference. First operand has 107 places, 82 transitions, 341 flow. Second operand 16 states and 644 transitions. [2024-10-14 23:43:17,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 219 transitions, 1340 flow [2024-10-14 23:43:17,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 219 transitions, 1328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 23:43:17,395 INFO L231 Difference]: Finished difference. Result has 123 places, 88 transitions, 414 flow [2024-10-14 23:43:17,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=414, PETRI_PLACES=123, PETRI_TRANSITIONS=88} [2024-10-14 23:43:17,396 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 46 predicate places. [2024-10-14 23:43:17,396 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 88 transitions, 414 flow [2024-10-14 23:43:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.54545454545455) internal successors, (358), 11 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:17,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:17,397 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:17,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 23:43:17,397 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:17,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash -490173892, now seen corresponding path program 1 times [2024-10-14 23:43:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101326568] [2024-10-14 23:43:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:17,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101326568] [2024-10-14 23:43:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101326568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:17,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:17,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 23:43:17,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150780760] [2024-10-14 23:43:17,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:17,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 23:43:17,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:17,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 23:43:17,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:43:17,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:17,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 88 transitions, 414 flow. Second operand has 8 states, 8 states have (on average 35.375) internal successors, (283), 8 states have internal predecessors, (283), 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-10-14 23:43:17,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:17,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:17,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:18,210 INFO L124 PetriNetUnfolderBase]: 1797/3899 cut-off events. [2024-10-14 23:43:18,210 INFO L125 PetriNetUnfolderBase]: For 4325/4325 co-relation queries the response was YES. [2024-10-14 23:43:18,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10950 conditions, 3899 events. 1797/3899 cut-off events. For 4325/4325 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 23221 event pairs, 361 based on Foata normal form. 36/3909 useless extension candidates. Maximal degree in co-relation 10924. Up to 1802 conditions per place. [2024-10-14 23:43:18,222 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 122 selfloop transitions, 12 changer transitions 10/168 dead transitions. [2024-10-14 23:43:18,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 168 transitions, 1037 flow [2024-10-14 23:43:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 23:43:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 23:43:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 435 transitions. [2024-10-14 23:43:18,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5240963855421686 [2024-10-14 23:43:18,223 INFO L175 Difference]: Start difference. First operand has 123 places, 88 transitions, 414 flow. Second operand 10 states and 435 transitions. [2024-10-14 23:43:18,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 168 transitions, 1037 flow [2024-10-14 23:43:18,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 168 transitions, 1008 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-10-14 23:43:18,231 INFO L231 Difference]: Finished difference. Result has 118 places, 84 transitions, 376 flow [2024-10-14 23:43:18,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=376, PETRI_PLACES=118, PETRI_TRANSITIONS=84} [2024-10-14 23:43:18,232 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 41 predicate places. [2024-10-14 23:43:18,232 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 84 transitions, 376 flow [2024-10-14 23:43:18,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.375) internal successors, (283), 8 states have internal predecessors, (283), 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-10-14 23:43:18,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:18,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:18,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 23:43:18,232 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:18,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash 786469338, now seen corresponding path program 1 times [2024-10-14 23:43:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:18,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096660159] [2024-10-14 23:43:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096660159] [2024-10-14 23:43:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096660159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 23:43:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072146951] [2024-10-14 23:43:19,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:19,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 23:43:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 23:43:19,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 23:43:19,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2024-10-14 23:43:19,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 84 transitions, 376 flow. Second operand has 13 states, 13 states have (on average 32.23076923076923) internal successors, (419), 13 states have internal predecessors, (419), 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-10-14 23:43:19,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:19,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2024-10-14 23:43:19,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:19,644 INFO L124 PetriNetUnfolderBase]: 1819/3893 cut-off events. [2024-10-14 23:43:19,644 INFO L125 PetriNetUnfolderBase]: For 4172/4174 co-relation queries the response was YES. [2024-10-14 23:43:19,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10957 conditions, 3893 events. 1819/3893 cut-off events. For 4172/4174 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 22784 event pairs, 265 based on Foata normal form. 26/3899 useless extension candidates. Maximal degree in co-relation 10931. Up to 972 conditions per place. [2024-10-14 23:43:19,659 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 142 selfloop transitions, 15 changer transitions 16/194 dead transitions. [2024-10-14 23:43:19,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 194 transitions, 1208 flow [2024-10-14 23:43:19,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 23:43:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-14 23:43:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 532 transitions. [2024-10-14 23:43:19,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49304911955514363 [2024-10-14 23:43:19,660 INFO L175 Difference]: Start difference. First operand has 118 places, 84 transitions, 376 flow. Second operand 13 states and 532 transitions. [2024-10-14 23:43:19,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 194 transitions, 1208 flow [2024-10-14 23:43:19,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 194 transitions, 1185 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-14 23:43:19,670 INFO L231 Difference]: Finished difference. Result has 122 places, 83 transitions, 379 flow [2024-10-14 23:43:19,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=379, PETRI_PLACES=122, PETRI_TRANSITIONS=83} [2024-10-14 23:43:19,671 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 45 predicate places. [2024-10-14 23:43:19,671 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 83 transitions, 379 flow [2024-10-14 23:43:19,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.23076923076923) internal successors, (419), 13 states have internal predecessors, (419), 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-10-14 23:43:19,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:19,672 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:19,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 23:43:19,673 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:19,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash -851179633, now seen corresponding path program 1 times [2024-10-14 23:43:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965853577] [2024-10-14 23:43:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965853577] [2024-10-14 23:43:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965853577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:20,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:20,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 23:43:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80174213] [2024-10-14 23:43:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:20,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 23:43:20,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:20,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 23:43:20,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:43:20,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2024-10-14 23:43:20,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 83 transitions, 379 flow. Second operand has 8 states, 8 states have (on average 33.5) internal successors, (268), 8 states have internal predecessors, (268), 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-10-14 23:43:20,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:20,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2024-10-14 23:43:20,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:20,425 INFO L124 PetriNetUnfolderBase]: 1828/3938 cut-off events. [2024-10-14 23:43:20,425 INFO L125 PetriNetUnfolderBase]: For 4243/4243 co-relation queries the response was YES. [2024-10-14 23:43:20,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11208 conditions, 3938 events. 1828/3938 cut-off events. For 4243/4243 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 23290 event pairs, 982 based on Foata normal form. 12/3924 useless extension candidates. Maximal degree in co-relation 11182. Up to 1954 conditions per place. [2024-10-14 23:43:20,438 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 74 selfloop transitions, 19 changer transitions 0/114 dead transitions. [2024-10-14 23:43:20,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 114 transitions, 703 flow [2024-10-14 23:43:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 23:43:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 23:43:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 272 transitions. [2024-10-14 23:43:20,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46815834767641995 [2024-10-14 23:43:20,439 INFO L175 Difference]: Start difference. First operand has 122 places, 83 transitions, 379 flow. Second operand 7 states and 272 transitions. [2024-10-14 23:43:20,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 114 transitions, 703 flow [2024-10-14 23:43:20,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 675 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-10-14 23:43:20,447 INFO L231 Difference]: Finished difference. Result has 114 places, 82 transitions, 383 flow [2024-10-14 23:43:20,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=114, PETRI_TRANSITIONS=82} [2024-10-14 23:43:20,447 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 37 predicate places. [2024-10-14 23:43:20,447 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 82 transitions, 383 flow [2024-10-14 23:43:20,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.5) internal successors, (268), 8 states have internal predecessors, (268), 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-10-14 23:43:20,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:20,447 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 23:43:20,448 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:20,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1306314206, now seen corresponding path program 1 times [2024-10-14 23:43:20,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:20,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009371202] [2024-10-14 23:43:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:21,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:21,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009371202] [2024-10-14 23:43:21,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009371202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:43:21,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:43:21,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 23:43:21,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192506904] [2024-10-14 23:43:21,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:43:21,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 23:43:21,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:43:21,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 23:43:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 23:43:21,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-14 23:43:21,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 82 transitions, 383 flow. Second operand has 11 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:21,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:43:21,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-14 23:43:21,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 23:43:21,631 INFO L124 PetriNetUnfolderBase]: 1748/3801 cut-off events. [2024-10-14 23:43:21,631 INFO L125 PetriNetUnfolderBase]: For 4270/4270 co-relation queries the response was YES. [2024-10-14 23:43:21,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10758 conditions, 3801 events. 1748/3801 cut-off events. For 4270/4270 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 22147 event pairs, 258 based on Foata normal form. 26/3807 useless extension candidates. Maximal degree in co-relation 10732. Up to 926 conditions per place. [2024-10-14 23:43:21,645 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 140 selfloop transitions, 15 changer transitions 17/194 dead transitions. [2024-10-14 23:43:21,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 194 transitions, 1219 flow [2024-10-14 23:43:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 23:43:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-14 23:43:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 557 transitions. [2024-10-14 23:43:21,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5162187210379982 [2024-10-14 23:43:21,646 INFO L175 Difference]: Start difference. First operand has 114 places, 82 transitions, 383 flow. Second operand 13 states and 557 transitions. [2024-10-14 23:43:21,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 194 transitions, 1219 flow [2024-10-14 23:43:21,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 194 transitions, 1181 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 23:43:21,654 INFO L231 Difference]: Finished difference. Result has 120 places, 81 transitions, 369 flow [2024-10-14 23:43:21,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=369, PETRI_PLACES=120, PETRI_TRANSITIONS=81} [2024-10-14 23:43:21,655 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, 43 predicate places. [2024-10-14 23:43:21,655 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 81 transitions, 369 flow [2024-10-14 23:43:21,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:43:21,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 23:43:21,656 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:43:21,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 23:43:21,656 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-10-14 23:43:21,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:43:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash -468998958, now seen corresponding path program 1 times [2024-10-14 23:43:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:43:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365430879] [2024-10-14 23:43:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:21,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:43:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:43:22,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:43:22,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365430879] [2024-10-14 23:43:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365430879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 23:43:22,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647289823] [2024-10-14 23:43:22,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:43:22,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 23:43:22,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:43:22,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 23:43:22,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 23:43:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:43:22,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-14 23:43:22,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:43:22,726 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 22 treesize of output 21 [2024-10-14 23:43:22,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2024-10-14 23:43:22,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 154 [2024-10-14 23:43:23,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 144 [2024-10-14 23:43:23,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 312 [2024-10-14 23:43:23,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1704 treesize of output 1487 [2024-10-14 23:43:24,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5401 treesize of output 4660 [2024-10-14 23:43:31,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16105 treesize of output 13988 [2024-10-14 23:43:36,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42900 treesize of output 37107 [2024-10-14 23:44:08,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112165 treesize of output 97249 [2024-10-14 23:44:11,685 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 ((as const (Array Int Int)) 0))) (or (exists ((v_DerPreprocessor_57 Int) (v_DerPreprocessor_55 Int) (v_DerPreprocessor_56 Int) (v_DerPreprocessor_23 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_37 Int) (v_DerPreprocessor_49 Int) (v_DerPreprocessor_27 Int) (|~#queue~0.offset| Int) (v_DerPreprocessor_53 Int) (v_DerPreprocessor_21 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_8 Int)) (let ((.cse9 (+ 3204 |~#queue~0.offset|)) (.cse1 (+ 3208 |~#queue~0.offset|)) (.cse7 (+ 3200 |~#queue~0.offset|))) (let ((.cse0 (store (store (store (store .cse6 v_DerPreprocessor_21 v_DerPreprocessor_54) .cse9 v_DerPreprocessor_55) .cse1 v_DerPreprocessor_56) .cse7 v_DerPreprocessor_57))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (store (store .cse6 .cse7 v_DerPreprocessor_49) v_DerPreprocessor_21 (select .cse0 v_DerPreprocessor_21)))) (store (store .cse6 .cse7 (select .cse15 .cse7)) v_DerPreprocessor_21 (select (store (store .cse15 .cse9 v_DerPreprocessor_55) .cse1 v_DerPreprocessor_56) v_DerPreprocessor_21))))) (store (store (store .cse6 .cse7 (select .cse14 .cse7)) .cse9 v_DerPreprocessor_27) v_DerPreprocessor_21 (select (store (store .cse14 .cse1 v_DerPreprocessor_37) .cse9 v_DerPreprocessor_55) v_DerPreprocessor_21))))) (let ((.cse2 (select .cse13 .cse9))) (let ((.cse12 (store (store (store (store .cse6 .cse7 (select .cse13 .cse7)) .cse1 v_DerPreprocessor_23) .cse9 .cse2) v_DerPreprocessor_21 (select (store .cse13 .cse1 v_DerPreprocessor_37) v_DerPreprocessor_21)))) (let ((.cse3 (select .cse12 .cse9))) (let ((.cse5 (+ |~#queue~0.offset| (* .cse3 4)))) (let ((.cse4 (select (let ((.cse10 (select .cse12 .cse1))) (let ((.cse8 (let ((.cse11 (store (store .cse6 .cse7 (select .cse12 .cse7)) .cse5 v_DerPreprocessor_12))) (store (store (store .cse6 .cse7 (select .cse11 .cse7)) .cse9 v_DerPreprocessor_8) .cse5 (select (store (store .cse11 .cse1 .cse10) .cse9 .cse3) .cse5))))) (store (store (store (store .cse6 .cse7 (select .cse8 .cse7)) .cse9 (select .cse8 .cse9)) .cse1 0) .cse5 (select (store .cse8 .cse1 .cse10) .cse5)))) .cse9))) (and (<= (+ v_DerPreprocessor_56 1) v_DerPreprocessor_37) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| (select (store .cse0 (+ |~#queue~0.offset| (* v_DerPreprocessor_55 4)) v_DerPreprocessor_53) .cse1)) (<= v_DerPreprocessor_55 (+ .cse2 1)) (= .cse3 .cse4) (= v_DerPreprocessor_21 .cse5) (<= .cse4 0) (<= v_DerPreprocessor_37 2147483647))))))))))) (exists ((v_DerPreprocessor_58 Int) (v_DerPreprocessor_44 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_59 Int) (|~#queue~0.offset| Int) (v_DerPreprocessor_60 Int) (v_DerPreprocessor_61 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_53 Int) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_62 Int) (v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse24 (+ 3204 |~#queue~0.offset|)) (.cse20 (+ 3208 |~#queue~0.offset|)) (.cse22 (+ 3200 |~#queue~0.offset|))) (let ((.cse19 (store (store (store (store (store .cse6 v_prenex_4 v_DerPreprocessor_58) v_DerPreprocessor_15 v_DerPreprocessor_59) .cse24 v_DerPreprocessor_60) .cse20 v_DerPreprocessor_61) .cse22 v_DerPreprocessor_62))) (let ((.cse28 (let ((.cse30 (let ((.cse32 (store (store (store .cse6 .cse22 v_DerPreprocessor_44) v_prenex_4 (select .cse19 v_prenex_4)) v_DerPreprocessor_15 (select .cse19 v_DerPreprocessor_15)))) (let ((.cse33 (store (store .cse32 .cse24 v_DerPreprocessor_60) .cse20 v_DerPreprocessor_61))) (store (store (store .cse6 .cse22 (select .cse32 .cse22)) v_prenex_4 (select .cse33 v_prenex_4)) v_DerPreprocessor_15 (select .cse33 v_DerPreprocessor_15)))))) (let ((.cse31 (store (store .cse30 .cse20 v_DerPreprocessor_42) .cse24 v_DerPreprocessor_60))) (store (store (store (store .cse6 .cse22 (select .cse30 .cse22)) v_prenex_4 (select .cse31 v_prenex_4)) .cse24 v_DerPreprocessor_32) v_DerPreprocessor_15 (select .cse31 v_DerPreprocessor_15)))))) (let ((.cse17 (select .cse28 .cse24))) (let ((.cse27 (let ((.cse29 (store .cse28 .cse20 v_DerPreprocessor_42))) (store (store (store (store (store .cse6 .cse22 (select .cse28 .cse22)) v_prenex_4 (select .cse29 v_prenex_4)) .cse20 v_DerPreprocessor_18) .cse24 .cse17) v_DerPreprocessor_15 (select .cse29 v_DerPreprocessor_15))))) (let ((.cse25 (select .cse27 .cse20)) (.cse16 (select .cse27 .cse24))) (let ((.cse23 (let ((.cse26 (store (store .cse6 .cse22 (select .cse27 .cse22)) v_prenex_4 (select .cse27 v_prenex_4)))) (store (store (store .cse6 .cse22 (select .cse26 .cse22)) .cse24 v_prenex_3) v_prenex_4 (select (store (store .cse26 .cse20 .cse25) .cse24 .cse16) v_prenex_4))))) (let ((.cse18 (select .cse23 .cse24))) (let ((.cse21 (select (store (store (store (store .cse6 .cse22 (select .cse23 .cse22)) .cse24 .cse18) .cse20 0) v_prenex_4 (select (store .cse23 .cse20 .cse25) v_prenex_4)) .cse24))) (and (= (+ (* .cse16 4) |~#queue~0.offset|) v_DerPreprocessor_15) (<= v_DerPreprocessor_60 (+ .cse17 1)) (<= v_DerPreprocessor_42 2147483647) (not (= v_DerPreprocessor_15 v_prenex_4)) (<= (+ v_DerPreprocessor_61 1) v_DerPreprocessor_42) (<= .cse16 (+ .cse18 1)) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| (select (store .cse19 (+ (* v_DerPreprocessor_60 4) |~#queue~0.offset|) v_DerPreprocessor_53) .cse20)) (= (+ (* .cse21 4) |~#queue~0.offset|) v_prenex_4) (<= .cse21 0)))))))))))))) is different from true [2024-10-14 23:44:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 23:44:11,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 23:44:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:44:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647289823] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 23:44:19,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 23:44:19,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2024-10-14 23:44:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701351294] [2024-10-14 23:44:19,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 23:44:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 23:44:19,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:44:19,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 23:44:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1278, Unknown=13, NotChecked=76, Total=1640 [2024-10-14 23:44:19,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 83 [2024-10-14 23:44:19,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 81 transitions, 369 flow. Second operand has 41 states, 41 states have (on average 24.073170731707318) internal successors, (987), 41 states have internal predecessors, (987), 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-10-14 23:44:19,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 23:44:19,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 83 [2024-10-14 23:44:19,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand