./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:48:46,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:48:46,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:48:46,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:48:46,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:48:47,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:48:47,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:48:47,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:48:47,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:48:47,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:48:47,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:48:47,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:48:47,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:48:47,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:48:47,016 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:48:47,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:48:47,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:48:47,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:47,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:47,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:48:47,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:48:47,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 [2025-01-10 06:48:47,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:48:47,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:48:47,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:48:47,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:48:47,297 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:48:47,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-01-10 06:48:48,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad3667036/720e4ee2a29e46b8aeaee9fec971c8da/FLAG32482fd3a [2025-01-10 06:48:48,968 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:48:48,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-01-10 06:48:48,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad3667036/720e4ee2a29e46b8aeaee9fec971c8da/FLAG32482fd3a [2025-01-10 06:48:48,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad3667036/720e4ee2a29e46b8aeaee9fec971c8da [2025-01-10 06:48:48,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:48:48,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:48:48,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:48:48,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:48:49,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:48:49,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:48:48" (1/1) ... [2025-01-10 06:48:49,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5944c149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49, skipping insertion in model container [2025-01-10 06:48:49,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:48:48" (1/1) ... [2025-01-10 06:48:49,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:48:49,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:48:49,152 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:48:49,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:48:49,178 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:48:49,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49 WrapperNode [2025-01-10 06:48:49,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:48:49,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:48:49,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:48:49,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:48:49,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,226 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 19, calls inlined = 41, statements flattened = 519 [2025-01-10 06:48:49,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:48:49,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:48:49,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:48:49,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:48:49,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,274 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:48:49,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:48:49,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:48:49,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:48:49,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:48:49,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (1/1) ... [2025-01-10 06:48:49,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:49,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:48:49,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:48:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:48:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:48:49,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:48:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:48:49,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:48:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:48:49,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:48:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:48:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:48:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:48:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:48:49,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:48:49,352 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:48:49,429 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:48:49,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:48:50,135 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:48:50,136 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:48:52,015 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:48:52,015 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:48:52,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:52 BoogieIcfgContainer [2025-01-10 06:48:52,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:48:52,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:48:52,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:48:52,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:48:52,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:48:48" (1/3) ... [2025-01-10 06:48:52,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62171c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:48:52, skipping insertion in model container [2025-01-10 06:48:52,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:49" (2/3) ... [2025-01-10 06:48:52,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62171c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:48:52, skipping insertion in model container [2025-01-10 06:48:52,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:52" (3/3) ... [2025-01-10 06:48:52,025 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2025-01-10 06:48:52,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:48:52,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-subst.wvr.c that has 4 procedures, 96 locations, 1 initial locations, 0 loop locations, and 72 error locations. [2025-01-10 06:48:52,041 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:48:52,776 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:48:52,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 95 transitions, 211 flow [2025-01-10 06:48:53,008 INFO L124 PetriNetUnfolderBase]: 0/92 cut-off events. [2025-01-10 06:48:53,010 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:48:53,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 0/92 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 507 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-10 06:48:53,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 95 transitions, 211 flow [2025-01-10 06:48:53,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 90 transitions, 195 flow [2025-01-10 06:48:53,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:48:53,030 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;@59961eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:48:53,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-01-10 06:48:53,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:48:53,039 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:48:53,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:53,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:53,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:48:53,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:48:53,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash 70088442, now seen corresponding path program 1 times [2025-01-10 06:48:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:53,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556250808] [2025-01-10 06:48:53,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:53,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:48:53,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:48:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:48:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556250808] [2025-01-10 06:48:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556250808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:53,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:53,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:48:53,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874579934] [2025-01-10 06:48:53,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:53,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:48:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:53,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:48:53,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:48:53,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:48:53,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 195 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2025-01-10 06:48:53,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:53,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:48:53,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:09,905 INFO L124 PetriNetUnfolderBase]: 34236/49456 cut-off events. [2025-01-10 06:49:09,906 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2025-01-10 06:49:09,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99698 conditions, 49456 events. 34236/49456 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 11172. Compared 430611 event pairs, 34236 based on Foata normal form. 0/12567 useless extension candidates. Maximal degree in co-relation 97143. Up to 49096 conditions per place. [2025-01-10 06:49:10,176 INFO L140 encePairwiseOnDemand]: 71/95 looper letters, 63 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2025-01-10 06:49:10,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 273 flow [2025-01-10 06:49:10,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:49:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 06:49:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 99 transitions. [2025-01-10 06:49:10,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210526315789473 [2025-01-10 06:49:10,190 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 195 flow. Second operand 2 states and 99 transitions. [2025-01-10 06:49:10,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 273 flow [2025-01-10 06:49:10,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:49:10,497 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 138 flow [2025-01-10 06:49:10,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2025-01-10 06:49:10,501 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2025-01-10 06:49:10,501 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 138 flow [2025-01-10 06:49:10,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2025-01-10 06:49:10,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:10,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:49:10,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:49:10,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:49:10,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash 70088443, now seen corresponding path program 1 times [2025-01-10 06:49:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:10,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040041575] [2025-01-10 06:49:10,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:10,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:10,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:49:10,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:49:10,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:10,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:10,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040041575] [2025-01-10 06:49:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040041575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:10,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:49:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024122544] [2025-01-10 06:49:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:10,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:49:10,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:10,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:49:10,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:49:10,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:49:10,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:10,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:10,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:49:10,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:23,052 INFO L124 PetriNetUnfolderBase]: 30757/44492 cut-off events. [2025-01-10 06:49:23,053 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-10 06:49:23,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89348 conditions, 44492 events. 30757/44492 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9959. Compared 383093 event pairs, 30757 based on Foata normal form. 0/11498 useless extension candidates. Maximal degree in co-relation 89345. Up to 44150 conditions per place. [2025-01-10 06:49:23,226 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 60 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-01-10 06:49:23,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 256 flow [2025-01-10 06:49:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:49:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:49:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-01-10 06:49:23,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28421052631578947 [2025-01-10 06:49:23,229 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 138 flow. Second operand 3 states and 81 transitions. [2025-01-10 06:49:23,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 256 flow [2025-01-10 06:49:23,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:49:23,232 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 136 flow [2025-01-10 06:49:23,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-01-10 06:49:23,233 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2025-01-10 06:49:23,233 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 136 flow [2025-01-10 06:49:23,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:23,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:23,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:49:23,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:49:23,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:49:23,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:23,363 INFO L85 PathProgramCache]: Analyzing trace with hash 70088444, now seen corresponding path program 1 times [2025-01-10 06:49:23,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:23,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920711834] [2025-01-10 06:49:23,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:23,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:23,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:49:23,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:49:23,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:23,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920711834] [2025-01-10 06:49:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920711834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:23,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:49:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702945300] [2025-01-10 06:49:23,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:23,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:49:23,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:23,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:49:23,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:49:23,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:49:23,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:23,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:23,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:49:23,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:34,474 INFO L124 PetriNetUnfolderBase]: 27464/39790 cut-off events. [2025-01-10 06:49:34,475 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 06:49:34,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79926 conditions, 39790 events. 27464/39790 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 8817. Compared 339538 event pairs, 27464 based on Foata normal form. 0/10475 useless extension candidates. Maximal degree in co-relation 79922. Up to 39467 conditions per place. [2025-01-10 06:49:34,630 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 58 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-01-10 06:49:34,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 250 flow [2025-01-10 06:49:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:49:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:49:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-01-10 06:49:34,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2771929824561403 [2025-01-10 06:49:34,633 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 136 flow. Second operand 3 states and 79 transitions. [2025-01-10 06:49:34,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 250 flow [2025-01-10 06:49:34,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:49:34,634 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 133 flow [2025-01-10 06:49:34,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2025-01-10 06:49:34,635 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -29 predicate places. [2025-01-10 06:49:34,636 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 133 flow [2025-01-10 06:49:34,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:34,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:34,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:49:34,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:49:34,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:49:34,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash 70088446, now seen corresponding path program 1 times [2025-01-10 06:49:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455928294] [2025-01-10 06:49:34,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:49:34,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:49:34,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:34,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455928294] [2025-01-10 06:49:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455928294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:49:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147668689] [2025-01-10 06:49:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:49:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:34,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:49:34,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:49:34,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:49:34,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:34,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:34,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:49:34,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:43,916 INFO L124 PetriNetUnfolderBase]: 24456/35468 cut-off events. [2025-01-10 06:49:43,917 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 06:49:43,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71247 conditions, 35468 events. 24456/35468 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 7804. Compared 298965 event pairs, 24456 based on Foata normal form. 0/9505 useless extension candidates. Maximal degree in co-relation 71243. Up to 35180 conditions per place. [2025-01-10 06:49:44,051 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 56 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-01-10 06:49:44,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 243 flow [2025-01-10 06:49:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:49:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:49:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-01-10 06:49:44,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27017543859649124 [2025-01-10 06:49:44,053 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 3 states and 77 transitions. [2025-01-10 06:49:44,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 243 flow [2025-01-10 06:49:44,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:49:44,054 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 130 flow [2025-01-10 06:49:44,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-01-10 06:49:44,055 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -30 predicate places. [2025-01-10 06:49:44,055 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 130 flow [2025-01-10 06:49:44,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:44,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:44,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:49:44,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:49:44,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:49:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash 70088447, now seen corresponding path program 1 times [2025-01-10 06:49:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:44,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256673437] [2025-01-10 06:49:44,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:44,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:49:44,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:49:44,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:44,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256673437] [2025-01-10 06:49:44,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256673437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:44,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:44,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:49:44,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522404639] [2025-01-10 06:49:44,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:44,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:49:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:44,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:49:44,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:49:44,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:49:44,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:44,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:44,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:49:44,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:52,070 INFO L124 PetriNetUnfolderBase]: 21622/31394 cut-off events. [2025-01-10 06:49:52,071 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-10 06:49:52,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63066 conditions, 31394 events. 21622/31394 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6854. Compared 261726 event pairs, 21622 based on Foata normal form. 0/8581 useless extension candidates. Maximal degree in co-relation 63062. Up to 31139 conditions per place. [2025-01-10 06:49:52,192 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 54 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-01-10 06:49:52,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 236 flow [2025-01-10 06:49:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:49:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:49:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-10 06:49:52,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2631578947368421 [2025-01-10 06:49:52,194 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 130 flow. Second operand 3 states and 75 transitions. [2025-01-10 06:49:52,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 236 flow [2025-01-10 06:49:52,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 58 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:49:52,195 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 127 flow [2025-01-10 06:49:52,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-01-10 06:49:52,196 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -31 predicate places. [2025-01-10 06:49:52,196 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 127 flow [2025-01-10 06:49:52,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:52,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:52,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:49:52,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:49:52,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:49:52,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash 70088449, now seen corresponding path program 1 times [2025-01-10 06:49:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:52,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505449193] [2025-01-10 06:49:52,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:52,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:52,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:49:52,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:49:52,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:52,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:52,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:52,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505449193] [2025-01-10 06:49:52,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505449193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:52,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:52,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:49:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001645590] [2025-01-10 06:49:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:52,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:49:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:52,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:49:52,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:49:52,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:49:52,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:52,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:52,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:49:52,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:59,787 INFO L124 PetriNetUnfolderBase]: 19015/27662 cut-off events. [2025-01-10 06:49:59,787 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-10 06:49:59,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55585 conditions, 27662 events. 19015/27662 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 5965. Compared 228618 event pairs, 19015 based on Foata normal form. 0/7734 useless extension candidates. Maximal degree in co-relation 55581. Up to 27424 conditions per place. [2025-01-10 06:49:59,879 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 52 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2025-01-10 06:49:59,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 229 flow [2025-01-10 06:49:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:49:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:49:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 06:49:59,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.256140350877193 [2025-01-10 06:49:59,880 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 127 flow. Second operand 3 states and 73 transitions. [2025-01-10 06:49:59,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 229 flow [2025-01-10 06:49:59,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:49:59,881 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 124 flow [2025-01-10 06:49:59,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2025-01-10 06:49:59,881 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -32 predicate places. [2025-01-10 06:49:59,881 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 124 flow [2025-01-10 06:49:59,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:59,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:59,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:49:59,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:49:59,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:49:59,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash 70088450, now seen corresponding path program 1 times [2025-01-10 06:49:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:59,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145608802] [2025-01-10 06:49:59,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:59,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:59,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:49:59,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:49:59,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:59,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:59,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145608802] [2025-01-10 06:49:59,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145608802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:59,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:59,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:49:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945462063] [2025-01-10 06:49:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:59,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:49:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:59,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:49:59,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:49:59,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:49:59,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:49:59,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:59,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:49:59,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:06,446 INFO L124 PetriNetUnfolderBase]: 16574/24164 cut-off events. [2025-01-10 06:50:06,446 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 06:50:06,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48572 conditions, 24164 events. 16574/24164 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 5139. Compared 198156 event pairs, 16574 based on Foata normal form. 0/6929 useless extension candidates. Maximal degree in co-relation 48568. Up to 23943 conditions per place. [2025-01-10 06:50:06,520 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 50 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-01-10 06:50:06,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 222 flow [2025-01-10 06:50:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-01-10 06:50:06,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24912280701754386 [2025-01-10 06:50:06,522 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 124 flow. Second operand 3 states and 71 transitions. [2025-01-10 06:50:06,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 222 flow [2025-01-10 06:50:06,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 54 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:06,524 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 121 flow [2025-01-10 06:50:06,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-01-10 06:50:06,524 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -33 predicate places. [2025-01-10 06:50:06,524 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 121 flow [2025-01-10 06:50:06,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:50:06,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:06,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:50:06,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:50:06,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:50:06,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash 70088452, now seen corresponding path program 1 times [2025-01-10 06:50:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:06,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537377349] [2025-01-10 06:50:06,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:06,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:50:06,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:50:06,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:06,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537377349] [2025-01-10 06:50:06,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537377349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:06,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:06,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:06,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698150053] [2025-01-10 06:50:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:06,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:06,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:06,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:06,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:50:06,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:50:06,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:06,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:50:06,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:13,654 INFO L124 PetriNetUnfolderBase]: 14374/20990 cut-off events. [2025-01-10 06:50:13,654 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 06:50:13,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42195 conditions, 20990 events. 14374/20990 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4418. Compared 170677 event pairs, 14374 based on Foata normal form. 0/6173 useless extension candidates. Maximal degree in co-relation 42191. Up to 20798 conditions per place. [2025-01-10 06:50:13,729 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 48 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-01-10 06:50:13,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 215 flow [2025-01-10 06:50:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-01-10 06:50:13,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24210526315789474 [2025-01-10 06:50:13,730 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 121 flow. Second operand 3 states and 69 transitions. [2025-01-10 06:50:13,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 215 flow [2025-01-10 06:50:13,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:13,731 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 118 flow [2025-01-10 06:50:13,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-01-10 06:50:13,732 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2025-01-10 06:50:13,732 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 118 flow [2025-01-10 06:50:13,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:50:13,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:13,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:50:13,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:50:13,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:50:13,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 70088453, now seen corresponding path program 1 times [2025-01-10 06:50:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503633537] [2025-01-10 06:50:13,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:13,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:50:13,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:50:13,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:13,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:13,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:13,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503633537] [2025-01-10 06:50:13,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503633537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:13,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:13,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164220673] [2025-01-10 06:50:13,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:13,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:13,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:13,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:13,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:50:13,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:50:13,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:13,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:50:13,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:19,791 INFO L124 PetriNetUnfolderBase]: 12328/18036 cut-off events. [2025-01-10 06:50:19,791 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 06:50:19,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36260 conditions, 18036 events. 12328/18036 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 3752. Compared 143971 event pairs, 12328 based on Foata normal form. 0/5459 useless extension candidates. Maximal degree in co-relation 36256. Up to 17871 conditions per place. [2025-01-10 06:50:19,852 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 46 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-01-10 06:50:19,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 50 transitions, 208 flow [2025-01-10 06:50:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-01-10 06:50:19,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23508771929824562 [2025-01-10 06:50:19,853 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 118 flow. Second operand 3 states and 67 transitions. [2025-01-10 06:50:19,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 50 transitions, 208 flow [2025-01-10 06:50:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 50 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:19,854 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 115 flow [2025-01-10 06:50:19,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-01-10 06:50:19,856 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2025-01-10 06:50:19,856 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 115 flow [2025-01-10 06:50:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:50:19,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:19,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:50:19,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:50:19,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:50:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash 70088455, now seen corresponding path program 1 times [2025-01-10 06:50:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405279868] [2025-01-10 06:50:19,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:19,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:50:19,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:50:19,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:19,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405279868] [2025-01-10 06:50:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405279868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:19,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114971039] [2025-01-10 06:50:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:19,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:19,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:19,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:19,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:50:19,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:50:19,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:19,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:50:19,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:25,515 INFO L124 PetriNetUnfolderBase]: 10473/15368 cut-off events. [2025-01-10 06:50:25,515 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 06:50:25,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30909 conditions, 15368 events. 10473/15368 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 3139. Compared 121214 event pairs, 10473 based on Foata normal form. 0/4810 useless extension candidates. Maximal degree in co-relation 30905. Up to 15218 conditions per place. [2025-01-10 06:50:25,554 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 44 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-01-10 06:50:25,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 48 transitions, 201 flow [2025-01-10 06:50:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:50:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:50:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-01-10 06:50:25,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2025-01-10 06:50:25,555 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 115 flow. Second operand 3 states and 65 transitions. [2025-01-10 06:50:25,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 48 transitions, 201 flow [2025-01-10 06:50:25,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:25,556 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 112 flow [2025-01-10 06:50:25,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-01-10 06:50:25,557 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2025-01-10 06:50:25,557 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 112 flow [2025-01-10 06:50:25,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:50:25,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:25,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:50:25,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:50:25,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-01-10 06:50:25,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash 70088456, now seen corresponding path program 1 times [2025-01-10 06:50:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083172445] [2025-01-10 06:50:25,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:25,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:50:25,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:50:25,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:25,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:25,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:25,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083172445] [2025-01-10 06:50:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083172445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:25,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:50:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107655981] [2025-01-10 06:50:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:25,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:50:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:25,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:50:25,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:50:25,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-01-10 06:50:25,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-10 06:50:25,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:25,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-01-10 06:50:25,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand